Article ID Journal Published Year Pages File Type
425745 Future Generation Computer Systems 2006 9 Pages PDF
Abstract

As the rate at which disk drives read and write data is improving at a much slower pace than the speed of processors, I/O has risen to become the bottleneck in high-performance computing for many applications. A possible approach to address this problem is to schedule parallel I/O operations explicitly. To this end, we propose two new I/O scheduling algorithms and evaluate the relative performance of the proposed policies against two baseline policies. Simulation results show that the proposed policies outperform the baseline policies.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,