File(s) not publicly available
Parallel I/O scheduling in multiprogrammed cluster computing systems
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.
History
Event
Computational Science. Conference (2003 : Melbourne, Australia and St. Petersburg, Russia)Volume
2660Series
Lecture Notes in Computer SciencePagination
223 - 229Publisher
SpringerLocation
Melbourne, Australia and St. Petersburg, RussiaPlace of publication
Berlin, GermanyPublisher DOI
Start date
2003-06-02End date
2003-06-04ISSN
0302-9743eISSN
1611-3349Language
engPublication classification
E1.1 Full written paper - refereedCopyright notice
2003, Springer-Verlag Berlin HeidelbergEditor/Contributor(s)
P Sloot, D Abramson, A Bogdanov, Y Gorbachev, J Dongarra, A ZomayaTitle of proceedings
Computational Science — ICCS 2003 : International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2–4, 2003 Proceedings, Part IVUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC