d-clock: distributed QoS in heterogeneous resource environments

Authors:
Ajay Gulati;Arif Merchant;Peter Varman
Affiliations:
Rice University, Houston, TX;HP Labs, Palo Alto, CA;Rice University, Houston, TX
Venue:
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Year:
2007

Citing 6
Cited 3

Interposed proportional sharing for a storage service utility

Proceedings of the joint international conference on Measurement and modeling of computer systems
FAB: building distributed enterprise disk arrays from commodity components

ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
Lexicographic QoS scheduling for parallel I/O

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
IBM intelligent Bricks project: petabytes and beyond

IBM Journal of Research and Development
pClock: an arrival curve based approach for QoS guarantees in shared storage systems

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proportional-share scheduling for distributed storage systems

FAST '07 Proceedings of the 5th USENIX conference on File and Storage Technologies

Towards distributed storage resource management using flow control

ACM SIGOPS Operating Systems Review
PARDA: proportional allocation of resources for distributed storage access

FAST '09 Proccedings of the 7th conference on File and storage technologies
mClock: handling throughput variability for hypervisor IO scheduling

OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the problem of providing fair bandwidth allocation in distributed storage systems similar to the research prototypes HP FAB and IBM Intelligent Bricks. The problem poses significant new challenges beyond those encountered in network and storage QoS scheduling. Specifically, resources are heterogeneous i.e. an IO request can only be serviced by a particular server, and service is both requested and provided in a distributed manner with no centralized controller. We provide a distributed algorithm, d-Clock, that runs locally on each of the servers and provides global fairness guarantees without causing resource-specific starvation, with minimal synchronization overhead.