Scalable implementations of MPI atomicity for concurrent overlapping I/O
Liao, W.-K.
Alok Choudhary
Coloma, K.
Thiruvathukal, G.K.
Ward, L.
Russell, E.
Pundit, N.
ECE Dept., Northwestern Univ., Evanston, IL;
This paper appears in: Parallel Processing, 2003. Proceedings. 2003 International Conference on
Publication Date: 9-9 Oct. 2003
On page(s): 239-246
Location: Kaohsiung,
ISSN: 0190-3918
ISBN: 0-7695-2017-0
INSPEC Accession Number: 8301801
Digital Object Identifier: 10.1109/ICPP.2003.1240586
Current Version Published: 2003-10-27
Abstract
For concurrent I/O operations, atomicity defines the results in the overlapping file regions simultaneously read/written by requesting processes. Atomicity has been well studied at the file system level, such as POSIX standard. We investigate the problems arising from the implementation of MPI atomicity for concurrent overlapping write access and provide two programming solutions. Since the MPI definition of atomicity differs from the POSIX one, an implementation that simply relies on the POSIX file systems does not guarantee correct MPI semantics. To have a correct implementation of atomic I/O in MPI, we examine the efficiency of three approaches: I) file locking, 2) graph-coloring, and 3) process-rank ordering. Performance complexity for these methods are analyzed and their experimental results are presented for file systems including NFS, SGI's XFS, and IBM's GPFS
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
