An Adaptive Mechanism for Fair Sharing of Storage Resources

Date Added: Oct 2009
Format: PDF

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.