Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1281100.1281157 | PODC |
Keywords | Field | DocType |
io request,storage system,global fairness guarantee,fair bandwidth allocation,ibm intelligent bricks,storage qos scheduling,heterogeneous resource environment,hp fab,particular server,minimal synchronization overhead,centralized controller,distributed storage,distributed algorithm,scheduling,resource allocation,qos | Synchronization,Bandwidth allocation,Computer science,Scheduling (computing),Distributed data store,Server,Quality of service,Computer network,Distributed algorithm,Resource allocation,Distributed computing | Conference |
Citations | PageRank | References |
5 | 0.71 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajay Gulati | 1 | 573 | 27.79 |
| Arif Merchant | 2 | 1684 | 133.81 |
| Peter J. Varman | 3 | 700 | 83.23 |