By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wachs, M. ; Parallel Data Lab., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Ganger, G.R.

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. Experiments with 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.

Published in:

Reliable Distributed Systems, 2009. SRDS '09. 28th IEEE International Symposium on

Date of Conference:

27-30 Sept. 2009