loading...
Performance Analysis of Parallel I/O Scheduling Approaches on Cluster Computing Systems
Tokyo, Japan May 12-May 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGRID.2003.1199439Third IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
J. H. Abawajy, Carleton University
As computation and communication hardware performance continue to rapidly increase, I/O represents a growing fraction of application execution time. This gap between the I/O subsystem and others is expected to increase in future since I/O performance is limited by physical motion. Therefore, it is imperative that novel techniques for improveing I/O performance be developed. Parallel I/O is a promising approach to alleviating this bottleneck. However, very little work exist with respect to scheduling parallel I/O operations explicitly. In this paper, we address the problem of effective management of parallel I/O in cluster computing systems by using appropriate I/O scheduling strategies. We propose two new I/O scheduling algorithms and compare them with two existing scheduling Approaches. The preliminary results show that the proposed policies outperform existing policies substantially.
Citation:
J. H. Abawajy, "Performance Analysis of Parallel I/O Scheduling Approaches on Cluster Computing Systems," ccgrid, pp.724, Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions