Abstract | ||
---|---|---|
The paper examines the problem of fair bandwidth allocation in heterogeneous storage systems in the framework of multi-resource allocation. We first extend the Bottleneck Aware Allocation model recently proposed by the authors to directly compute the maximum allocation satisfyinglocal fairness, envy freedom and sharing incentive. Next, we broaden the solution space to all allocations that satisfy envy freedom and sharing incentive even if they do not satisfy local fairness. We present an efficient algorithm to maximize the system utilization in the more general model. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1145/2612669.2612709 | SPAA |
Keywords | Field | DocType |
multiple resource allocation,storage hierarchies,allocation/deallocation strategies,io scheduling,centralization/decentralization,envy free,hybrid storage,secondary storage,qos,fair allocation | Max-min fairness,Bottleneck,Incentive,Bandwidth allocation,Computer science,Quality of service,Envy-free,Hybrid storage,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Peter J. Varman | 1 | 700 | 83.23 |
Hui Wang | 2 | 48 | 3.89 |