Instability in parallel I/O systems

Authors:
James B. Sinclair;Jay Tang;Peter J. Varman
Affiliations:
Department of Electrical and Computer Engineering, Rice University, Houston, TX;Department of Electrical and Computer Engineering, Rice University, Houston, TX;Department of Electrical and Computer Engineering, Rice University, Houston, TX
Venue:
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Year:
1994

Citing 8
Cited 0

The input/output complexity of sorting and related problems

Communications of the ACM
Optimal disk I/O with parallel block transfer

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Large-scale sorting in parallel memories (extended abstract)

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel database systems: the future of high performance database systems

Communications of the ACM
Fast permuting on disk arrays

Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
Parallel access to files in the Vesta file system

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Markov analysis of multiple-disk prefetching strategies for external merging

Theoretical Computer Science - Special issue on dependable parallel computing
Impact of Data Placement on Parallel I/O Systems

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performance of a shared-disk parallel I/O system with several concurrent processes is studied. It is observed that under some naturally occurring conditions such a system can exhibit instability, with a subset of the processes racing ahead of the others and monopolizing I/O resources. This race can lead to serialization of the processes and poor disk utilization. The study has implications for both data placement in multiple disk systems and task partitioning for parallel processing.