Name
Abstract | ||
|---|---|---|
Fairness and overall I/O efficiency are two opposing forces when it comes to sharing I/O among different applications. Although providing QoS guarantees for applications sharing a storage server are desirable under many scenarios, existing work has not been able to make a convincing case for using fairness mechanisms for disk scheduling, mainly due to their impact on overall throughout. In this work, we plan to investigate two major issues: (1) study the trade-off between fairness and efficiency, and develop mechanisms to improve the I/O efficiency of fair schedulers (2) provide performance guarantees to applications in terms of higher-level application metrics (such as transactions/sec), by changing the parameters in a fairness algorithm that affect the allocations at the block level. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1328690.1328715 | SIGMETRICS Performance Evaluation Review |
Keywords | Field | DocType |
fair schedulers,qos guarantee,o efficiency,convincing case,different application,block level,storage system,fairness algorithm,existing work,towards fairness,disk scheduling,fairness mechanism | File server,I/O scheduling,Computer science,Computer network,Quality of service,Real-time computing,Maximum throughput scheduling,Fairness measure,Distributed computing,Fair queuing | Journal |
Volume | Issue | Citations |
35 | 3 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajay Gulati | 1 | 573 | 27.79 |
| Peter J. Varman | 2 | 700 | 83.23 |
| Arif Merchant | 3 | 1684 | 133.81 |
| Mustafa Uysal | 4 | 1099 | 80.02 |