Co-scheduling of Disk Head Time in Cluster-Based Storage

Authors:
Matthew Wachs;Gregory R. Ganger
Affiliations:
-;-
Venue:
SRDS '09 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems
Year:
2009

Citing 0
Cited 4

IOrchestrator: Improving the Performance of Multi-node I/O Systems via Inter-Server Coordination

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
A scheduling framework that makes any disk schedulers non-work-conserving solely based on request characteristics

FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Busy bee: how to use traffic information for better scheduling of background tasks

ICPE '12 Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering
Data-Intensive Cloud Computing: Requirements, Expectations, Challenges, and Solutions

Journal of Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Disk time slicing is a promising technique for storage performance insulation. To work with cluster-based storage, however, time slices associated with striped data must be co-scheduled on the corresponding servers. This paper describes algorithms for determining global time slice schedules and mechanisms for coordinating the independent server activities. Experimentswith a prototype show that, combined, they can provide performance insulation for workloads sharing a storage cluster -- each workload realizes a configured minimum efficiency within its time slices regardless of the activities of the other workloads.