Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Journal of the ACM (JACM)
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Integrated parallel prefetching and caching
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Cello: a disk scheduling framework for next generation operating systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Optimal read-once parallel disk scheduling
Proceedings of the sixth workshop on I/O in parallel and distributed systems
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Minimizing stall time in single and parallel disk systems
Journal of the ACM (JACM)
Optimal prefetching and caching for parallel I/O sytems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Fair Scheduling in Internet Routers
IEEE Transactions on Computers
Traveling to Rome: QoS Specifications for Automated Storage System Management
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Disk Scheduling with Quality of Service Guarantees
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Start-Time Fair Queuing: A Scheduling Algorithm for Integrated ServicesPacket Switching Networks
Start-Time Fair Queuing: A Scheduling Algorithm for Integrated ServicesPacket Switching Networks
The QoSbox: A PC-Router for Quantitative Service Differentiation in IP Networks
The QoSbox: A PC-Router for Quantitative Service Differentiation in IP Networks
Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set
IEEE Transactions on Computers
Multi-dimensional storage virtualization
Proceedings of the joint international conference on Measurement and modeling of computer systems
Interposed proportional sharing for a storage service utility
Proceedings of the joint international conference on Measurement and modeling of computer systems
Façade: Virtual Storage Devices with Performance Guarantees
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
d-clock: distributed QoS in heterogeneous resource environments
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Journal of Parallel and Distributed Computing
Scheduling multiple flows on parallel disks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Hi-index | 0.01 |
High-end shared storage systems serving multiple independent workloads must assure that concurrently executing clients will receive a fair or agreed-upon share of system I/O resources. In a parallel I/O system an application makes requests for specific disks at different steps of its computation depending on the data layout and its computational state. Different applications contend for disk access making the problem of maintaining fair allocation challenging.We propose a model for differentiated disk bandwidth allocation based on lexicographic minimization, and provide new efficient scheduling algorithms to allocate the I/O bandwidth fairly among contending applications. A major contribution of our model is its ability to handle multiple parallel disks and contention for disks among the concurrent applications. Analysis and simulation-based evaluation shows that our algorithms provide performance isolation, weighted allocation of resources, and are work conserving. The solutions are also applicable to other shared resource environments dealing with non-uniform heterogeneous servers.