Parallel I/O scheduling in multiprogrammed cluster computing systems

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we address the problem of effective management of parallel I/O in multiprogrammed cluster computing systems by using appropriate I/O scheduling strategies. The performance of I/O devices lags behind the performance of processors and network systems, resulting in I/O becoming the bottleneck in current systems. This gap is expected to increase in the future since I/O performance is limited by physical motion. Therefore, it is imperative that novel techniques for improving I/O performance be developed. Parallel I/O is a promising approach to alleviating this bottleneck. However, very little work exists with respect to scheduling parallel I/O operations explicitly. We propose new I/O scheduling algorithms and evaluate the relative performance of the proposed policies against the most commonly used approaches. Our preliminary results show that the proposed policies outperform current methods and can substantially enhance the performance of real-world scientific applications. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Abawajy, J. H. (2003). Parallel I/O scheduling in multiprogrammed cluster computing systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2660, 223–229. https://doi.org/10.1007/3-540-44864-0_23

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