Services that share a storage system should realize the same efficiency, within their share of time, as when they have the system to themselves. The Argon storage server explicitly …
H Wang, P Varman - 12th USENIX Conference on File and Storage …, 2014 - usenix.org
Balancing Fairness and Efficiency in Tiered Storage Systems with Bottleneck-Aware Allocation Page 1 This paper is included in the Proceedings of the 12th USENIX Conference on File and …
A Povzner, T Kaldewey, S Brandt, R Golding… - Proceedings of the 3rd …, 2008 - dl.acm.org
Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations on …
H Song, Y Yin, XH Sun, R Thakur, S Lang - Proceedings of 2011 …, 2011 - dl.acm.org
Parallel file systems have become a common component of modern high-end computers to mask the ever-increasing gap between disk data access speed and CPU computing power …
The high degree of storage consolidation in modern virtualized datacenters requires flexible and efficient ways to allocate IO resources among virtual machines (VMs). Existing IO …
A Thomasian, M Blaum - ACM Transactions on Storage (TOS), 2009 - dl.acm.org
Parity is a popular form of data protection in redundant arrays of inexpensive/independent disks (RAID). RAID5 dedicates one out of N disks to parity to mask single disk failures, that …
JC Wu, SA Brandt - Proceedings of the 23rd IEEE/14th …, 2006 - pdfs.semanticscholar.org
Object Disk I/O Scheduler (ODIS) x Limit interference between classes x Allows reservations and reclaims unused bandwidth x Replaces standard elevator scheduler in OBFS xn QoS …
A Merchant, M Uysal, P Padala, X Zhu… - Proceedings of the 8th …, 2011 - dl.acm.org
Provisioning storage in disk arrays is a difficult problem because many applications with different workload characteristics and priorities share resources provided by the array …