By Topic

An Adaptive Mechanism for Fair Sharing of Storage Resources

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)
Chao Jin ; Dept. of Comput. Sci. & Software Eng., Univ. of Melbourne, Melbourne, VIC, Australia ; Buyya, R.

To ensure Quality of Service (QoS) for data centers, it is critical to enforce a fair share of storage resources between competing users. Interposed schedulers are one of the most practical methods for performance isolation. Most fair queuing-based proportional sharing algorithms for existing interposed scheduler are variants of counterparts designed for network routers and may result in breaking the fairness of proportional sharing required by Service Level Agreements for storage systems. This paper presents a novel algorithm to address this problem. As an extension of the fair queuing-based algorithm, it can dynamically adapt to the performance variation of storage systems and guarantee a fair sharing of resources as well as satisfying the minimal performance requirements for different clients. The design and performance evaluation are presented.

Published in:

Computer Architecture and High Performance Computing, 2009. SBAC-PAD '09. 21st International Symposium on

Date of Conference:

28-31 Oct. 2009