Abstract
Providing fairness and system efficiency are important, often conflicting, requirements when allocating shared resources. In a hybrid storage system the problem is complicated by the high variability in request service times, caused by speed differences between heterogeneous devices and workload-specific variations in access time within a device. This paper describes a model for fair time-based resource allocation in a hybrid storage system that has better fairness and efficiency than traditional IOPS-based schemes. An analytical model is developed and an optimal algorithm for fairly allocating device times to applications while maximizing the system throughput or utilization is presented. The results are validated using Linux implementations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
