I/O issues in a multimedia system
Computer
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
Disk Scheduling with Quality of Service Guarantees
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
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
Storage Performance Virtualization via Throughput and Latency Control
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Triage: Performance differentiation for storage systems using adaptive control
ACM Transactions on Storage (TOS)
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
Argon: performance insulation for shared storage servers
FAST '07 Proceedings of the 5th 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
| Hi-index | 0.00 |
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.