Scheduling with QoS in parallel I/O systems

Parallel I/O architectures are increasingly deployed for high performance computing and in shared data centers. In these environments it is desirable to provide QoS-based allocation of disk bandwidth to different applications sharing the I/O system. In this paper, we introduce a model of disk bandwidth allocation, and provide efficient scheduling algorithms to assign the bandwidth among the concurrent applications.

[1]  Ravi Jain,et al.  I/O in Parallel and Distributed Systems , 1998 .

[2]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[3]  Peter J. Varman,et al.  Optimal Read-Once Parallel Disk Scheduling , 1999, IOPADS '99.

[4]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[5]  Eric Anderson,et al.  Proceedings of the Fast 2002 Conference on File and Storage Technologies Hippodrome: Running Circles around Storage Administration , 2022 .

[6]  Laxmi N. Bhuyan,et al.  Fair Scheduling in Internet Routers , 2002, IEEE Trans. Computers.

[7]  Arif Merchant,et al.  Minerva: An automated resource provisioning tool for large-scale storage systems , 2001, TOCS.

[8]  Jeffrey Scott Vitter,et al.  Duality between Prefetching and Queued Writing with Parallel Disks , 2001, ESA.

[9]  Susanne Albers,et al.  Minimizing stall time in single and parallel disk systems , 2000, J. ACM.

[10]  Wei Jin,et al.  Interposed proportional sharing for a storage service utility , 2004, SIGMETRICS '04/Performance '04.

[11]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[12]  Banu Özden,et al.  Disk scheduling with quality of service guarantees , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[13]  Satish Rao,et al.  Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[15]  Jim Zelenka,et al.  Informed prefetching and caching , 1995, SOSP.

[16]  Randal C. Burns,et al.  Using multiple predictors to improve the accuracy of file access predictions , 2003, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings..

[17]  Peter J. Varman,et al.  Optimal prefetching and caching for parallel I/O sytems , 2001, SPAA '01.

[18]  Prashant J. Shenoy,et al.  Cello: A Disk Scheduling Framework for Next Generation Operating Systems* , 1998, SIGMETRICS '98/PERFORMANCE '98.

[19]  Arif Merchant,et al.  Façade: Virtual Storage Devices with Performance Guarantees , 2003, FAST.

[20]  Peter J. Varman,et al.  Optimal Read-once Parallel Disk Scheduling , 1999, IOPADS.

[21]  Anna R. Karlin,et al.  Integrated parallel prefetching and caching , 1996, SIGMETRICS '96.

[22]  John Wilkes,et al.  Traveling to Rome: QoS Specifications for Automated Storage System Management , 2001, IWQoS.

[23]  Nicolas Christin,et al.  The QoSbox: A PC-Router for Quantitative Service Differentiation in IP Networks , 2001 .