Matthieu Dorier

Matthieu Dorier

Auto-generated profile, based on publicly available information

Matthieu Dorier

Argonne National Laboratory, Lemont, IL, USA

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 January 2020 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
RRRobert B. Ross
Robert B. Ross
GAGeorge Amvrosiadis
George Amvrosiadis
PCPhilip Carns
Philip Carns
CCCharles D. Cranor
Charles D. Cranor
MDMatthieu Dorier
Matthieu Dorier
QZQing Zheng
Qing Zheng

5 October 2015 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MDMatthieu Dorier
Matthieu Dorier
SIShadi Ibrahim
Shadi Ibrahim
GAGabriel Antoniu
Gabriel Antoniu
RRRob Ross
Rob Ross
The increasing gap between the computation performance of post-petascale machines and the performance of their I/O subsystem has motivated many I/O optimizations including prefetching, caching, and scheduling. In order to further improve these techniques, modeling and predicting spatial and temporal I/O patterns of HPC applications as they run has become crucial. In this paper we present Omnisc'IO, an approach that builds a grammar-based model of the I/O behavior of HPC applications and uses it to predict when future I/O operations will occur, and where and how much data will be accessed. To infer grammars, Omnisc'IO is based on StarSequitur, a novel algorithm extending Nevill-Manning's Sequitur algorithm. Omnisc'IO is transparently integrated into the POSIX and MPI I/O stacks and does not require any modification in applications or higher-level I/O libraries. It works without any prior knowledge of the application and converges to accurate predictions of any N future I/O operations within a couple of iterations. Its implementation is efficient in both computation time and memory footprint.

1 December 2019 in Future Generation Computer Systems
Verified
Journal Article
Closed access
JWJustin M. Wozniak
Justin M. Wozniak
MDMatthieu Dorier
Matthieu Dorier
RRRobert Ross
Robert Ross
TSTong Shu
Tong Shu
TKTahsin Kurc
Tahsin Kurc
MWMatthew Wolf
Matthew Wolf

1 September 2016
Verified
Conference Paper
Closed access
MDMatthieu Dorier
Matthieu Dorier
MMMisbah Mubarak
Misbah Mubarak
RRRob Ross
Rob Ross
JLJianping Kelvin Li
Jianping Kelvin Li
CCChristopher D. Carothers
Christopher D. Carothers
KMKwa-Liu Ma
Kwa-Liu Ma
Two-tiered direct network topologies such as Dragonflies have been proposed for future post-petascale and exascale machines, since they provide a high-radix, low-diameter, fast interconnection network. Such topologies call for redesigningMPI collective communication algorithms in order to attain the best performance. Yet as increasingly more applications share a machine, it is not clear how these topology-aware algorithms will react to interference with concurrent jobs accessing the same network. In this paper, we study three topology-aware broadcast algorithms, including one designed by ourselves. We evaluate their performance through event-driven simulation for small-and large-sized broadcasts (in terms of both data size and number of processes). We study the effect of different routing mechanisms on the topology-aware collective algorithms, as well as their sensitivity to network contention with other jobs. Our results show that while topology-aware algorithms dramatically reduce link utilization, their advantage in terms of latency is more limited.

1 September 2016 in Future Generation Computer Systems
Verified
Journal Article
Closed access
MDMatthieu Dorier
Matthieu Dorier
OYOrcun Yildiz
Orcun Yildiz
SIShadi Ibrahim
Shadi Ibrahim
AOAnne-Cécile Orgerie
Anne-Cécile Orgerie
GAGabriel Antoniu
Gabriel Antoniu

17 September 2025 in Frontiers in High Performance Computing
Verified
Journal Article
Open access
PDF file
MDMatthieu Dorier
Matthieu Dorier
AGAmal Gueroudji
Amal Gueroudji
VHValérie Hayot-Sasson
Valérie Hayot-Sasson
HNHai Duc Nguyen
Hai Duc Nguyen
SOSeth Ockerman
Seth Ockerman
RRRobert B. Ross
Robert B. Ross
High-performance computing (HPC) applications have traditionally relied on parallel file systems and file transfer services to manage data movement and storage. Alternative approaches have been proposed that use direct communications between application components, trading persistence and fault tolerance for speed. Event-driven architectures, as popularized in enterprise contexts, present a compelling middle ground, avoiding the performance cost and API constraints of parallel file systems while retaining persistence and offering impedance matching between application components. However, adapting streaming frameworks to HPC workloads requires addressing challenges unique to HPC systems. This paper investigates the potential for a streaming framework designed for HPC infrastructures and use cases. We introduce Mofka, a persistent event-streaming framework designed specifically for HPC environments. Mofka combines the capabilities of a traditional streaming service with optimizations tailored to the HPC context, such as support for massively multicore nodes, efficient scaling for large producer-consumer workflows, RDMA-enabled high-performance network communications, specialized network fabrics with multiple links per node, and efficient handling of large scientific data payloads. Built using the Mochi suite of HPC data service components, Mofka provides a lightweight, modular, and high-performance solution for persistent streaming in HPC systems. We present the architecture of Mofka and evaluate its performance against Kafka and Redpanda using benchmarks on diverse platforms, including Argonne's Polaris and Oak Ridge's Frontier supercomputers, showing up to 8× improvement in throughput in some scenarios. We then demonstrate its utility in several real-world applications: a tomographic reconstruction pipeline, a workflow for the discovery of metal-organic frameworks for carbon capture, and the instrumentation of Dask workflows for provenance tracking and performance analysis.