Nicolas Morales
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nicolas Morales has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Bogdan Nicolae
Argonne National Laboratory, Lemont, USA
1 shared publication - Franck Cappello
Argonne National Laboratory, Lemont, USA
1 shared publication - Jack Marquez
University of Tennessee
1 shared publication - Jakob Luettgau
French Institute for Research in Computer Science and Automation, Bretagne Atlantique Research Centre (INRIA), Rennes, France
1 shared publication - Keita Teranishi
Oak Ridge National Laboratory, Oak Ridge, USA
1 shared publication - Michela Taufer
University of Tennessee, Knoxville, Knoxville, TN, USA
1 shared publication
Latest Publications
- Open Access
- 7 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 665-674
Scalable Incremental Checkpointing using GPU-Accelerated De-Duplication
Writing large amounts of data concurrently to stable storage is a typical I/O pattern of many HPC workflows. This pattern introduces high I/O overheads and results in increased storage space utilization especially for workflows that need to capture the evolution of data structures with high frequency as checkpoints. In this context, many applications, such as graph pattern matching, perform sparse updates to large data structures between checkpoints. For these applications, incremental checkpointing techniques that save only the differences from one checkpoint to another can dramatically reduce the checkpoint sizes, I/O bottlenecks, and storage space utilization. However, such techniques are not without challenges: it is non-trivial to transparently determine what data has changed since a previous checkpoint and assemble the differences in a compact fashion that does not result in excessive metadata. State-of-art data reduction techniques (e.g., compression and de-duplication) have significant limitations when applied to modern HPC applications that leverage GPUs: slow at detecting the differences, generate a large amount of metadata to keep track of the differences, and ignore crucial spatiotemporal checkpoint data redundancy. This paper addresses these challenges by proposing a Merkle tree-based incremental checkpointing method to exploit GPUs’ high memory bandwidth and massive parallelism. Experimental results at scale show a significant reduction of the I/O overhead and space utilization of checkpointing compared with state-of-the-art incremental checkpointing and compression techniques.
- 7 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 665-674
Open AccessScalable Incremental Checkpointing using GPU-Accelerated De-Duplication
Writing large amounts of data concurrently to stable storage is a typical I/O pattern of many HPC workflows. This pattern introduces high I/O overheads and results in increased storage space utilization especially for workflows that need to capture the evolution of data structures with high frequency as checkpoints. In this context, many applications, such as graph pattern matching, perform sparse updates to large data structures between checkpoints. For these applications, incremental checkpointing techniques that save only the differences from one checkpoint to another can dramatically reduce the checkpoint sizes, I/O bottlenecks, and storage space utilization. However, such techniques are not without challenges: it is non-trivial to transparently determine what data has changed since a previous checkpoint and assemble the differences in a compact fashion that does not result in excessive metadata. State-of-art data reduction techniques (e.g., compression and de-duplication) have significant limitations when applied to modern HPC applications that leverage GPUs: slow at detecting the differences, generate a large amount of metadata to keep track of the differences, and ignore crucial spatiotemporal checkpoint data redundancy. This paper addresses these challenges by proposing a Merkle tree-based incremental checkpointing method to exploit GPUs’ high memory bandwidth and massive parallelism. Experimental results at scale show a significant reduction of the I/O overhead and space utilization of checkpointing compared with state-of-the-art incremental checkpointing and compression techniques.