Conflict detection algorithm to minimize locking for MPI-IO atomicity

3Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many scientific applications require high-performance concurrent I/O accesses to a file by multiple processes. Those applications rely indirectly on atomic I/O capabilities in order to perform updates to structured datasets, such as those stored in HDF5 format files. Current support for atomicity in MPI-IO is provided by locking around the operations, imposing lock overhead in all situations, even though in many cases these operations are non-overlapping in the file. We propose to isolate non-overlapping accesses from overlapping ones in independent I/O cases, allowing the non-overlapping ones to proceed without imposing lock overhead. To enable this, we have implemented an efficient conflict detection algorithm in MPI-IO using MPI file views and datatypes. We show that our conflict detection scheme incurs minimal overhead on I/O operations, making it an effective mechanism for avoiding locks when they are not needed. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sehrish, S., Wang, J., & Thakur, R. (2009). Conflict detection algorithm to minimize locking for MPI-IO atomicity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5759 LNCS, pp. 143–153). Springer Verlag. https://doi.org/10.1007/978-3-642-03770-2_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free