Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marek T. Michalewicz

dblp:91/6903 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-6474-5234ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Graph data management · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph data management › graph database
distributed graph database
0.712023
The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores · SC 2023
Graph data management
graph database
0.712023
The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores · SC 2023
High-performance computing
performance optimization at scale
0.712023
The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores · SC 2023

Methods — techniques the papers use, named apart from their topics

one-sided communication · 1.3RDMA · 1.3MPI-inspired API · 1.3
YearPublicationVenuePosition
2023 The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores
abstract
Graph databases (GDBs) are crucial in academic and industry applications. The key challenges in developing GDBs are achieving high performance, scalability, programmability, and portability. To tackle these challenges, we harness established practices from the HPC landscape to build a system that outperforms all past GDBs presented in the literature by orders of magnitude, for both OLTP and OLAP workloads. For this, we first identify and crystallize performance-critical building blocks in the GDB design, and abstract them into a portable and programmable API specification, called the Graph Database Interface (GDI), inspired by the best practices of MPI. We then use GDI to design a GDB for distributed-memory RDMA architectures. Our implementation harnesses onesided RDMA communication and collective operations, and it offers architecture-independent theoretical performance guarantees. The resulting design achieves extreme scales of more than a hundred thousand cores. Our work will facilitate the development of next-generation extreme-scale graph databases.
Maciej Besta, Robert Gerstenberger, Michal Podstawski, Nils Blach, Berke Egeli, George Mitenkov, Wojciech Chlapek, Marek T. Michalewicz, Hubert Niewiadomski, Torsten Hoefler
SC9
2021 Classification of Single Cell Types using Small Sets of Expressed Genes: Comparative Analysis of Supervised Machine Learning Methods
abstract
Single cell transcriptomics measures gene expression data of large number of genes, concurrently, from tens of thousands of cells present in a studied biological sample. It is difficult to obtain good classification results due to high data dimensionality and variability of biological states. We performed a preliminary study to assess the feasibility of using supervised machine learning methods to classify peripheral blood mononuclear cell (PBMC) types from single cell gene expression data. We analyzed a large PBMC data set $(\sim 120,000$ PBMC cells), selected 47 genes (from 30698 features) suitable as SML classification features, and performed classification using 20 machine learning algorithms. Data sets represented three sample processing strategies: PBMC separation (two data sets), and experimental cell sorting by (two data sets). The accuracy in 5-class classification among 20 methods was 91-97% (PBMC separation), 97-100% (magnetic-activated cell sorting), and 82-99% (fluorescence-activated cell sorting). Our results indicate the feasibility of supervised machine learning for classification of cells into major PBMC cell types using a small number of classification features from single cell gene expression data.
Aleksandar Veljkovic, Mirjana M. Maljkovic, Nenad S. Mitic, Sasa N. Malkov, Minjie Lyu, Marek T. Michalewicz, Guanglan Zhang, Vladimir Brusic
BIBM7
2010 Diagnosing the root-causes of failures from cluster log files
abstract
System event logs are often the primary source of information for diagnosing (and predicting) the causes of failures for cluster systems. Due to interactions among the system hardware and software components, the system event logs for large cluster systems are comprised of streams of interleaved events, and only a small fraction of the events over a small time span are relevant to the diagnosis of a given failure. Furthermore, the process of troubleshooting the causes of failures is largely manual and ad-hoc. In this paper, we present a systematic methodology for reconstructing event order and establishing correlations among events which indicate the root-causes of a given failure from very large syslogs. We developed a diagnostics tool, FDiag, to extract the log entries as structured message templates and uses statistical correlation analysis to establish probable cause and effect relationships for the fault being analyzed. We applied FDiag to analyze failures due to breakdowns in interactions between the Lustre file system and its clients on the Ranger supercomputer at the Texas Advanced Computing Center (TACC). The results are positive. FDiag is able to identify the dates and the time periods that contain the significant events which eventually led to the occurrence of compute node soft lockups.
Edward Chuah, Shyh-Hao Kuo, Paul Hiew, William-Chandra Tjhi, Gary Kee Khoon Lee, John L. Hammond, Marek T. Michalewicz, Terence Hung, James C. Browne
HiPC7
1995 Perfect Scaling of the Electronic Structure Problem on a SIMD Architecture
Marek T. Michalewicz, Mark Priebatsch
Parallel Comput.1