Paper Info
Title
Reward Scheduling for QoS in Cloud Applications
Abstract
We present a novel QoS scheduling algorithm for multi-tiered storage servers made up of hard disks and SSDs. The work is motivated by the difference in access times for a workload as its SSD hit ratio changes. Our scheme is designed to reward clients according to their runtime behavior, while honoring their static QoS settings including shares (or weights), reservations and limits. A model based on entitlements is developed to describe the reward allocation policy (RAP). Simulation results show the advantages of RAP over conventional proportional share allocation in adapting to dynamically varying workloads. The proposed algorithm allows the client to directly reap the benefits of application performance tuning as if the client is on a dedicated system, addressing a key complaint of clients when moving to a shared infrastructure.
Year
DOI
Venue
2012
10.1109/CCGrid.2012.120
Cluster, Cloud and Grid Computing
Keywords
Field
DocType
novel qos scheduling algorithm,access time,hard disk,cloud applications,ssd hit ratio change,application performance,conventional proportional share allocation,static qos setting,proposed algorithm,dedicated system,reward allocation policy,rap,performance isolation,scheduling,synchronization,qos,throughput,servers,quality of service,cloud computing,scheduling algorithm,cloud,scheduling algorithms,resource management
Temporal isolation among virtual machines,Scheduling (computing),Computer science,Workload,Hit ratio,Server,Quality of service,Real-time computing,Performance tuning,Distributed computing,Cloud computing
Conference
ISBN
Citations 
PageRank 
978-1-4673-1395-7
7
0.50
References 
Authors
21
3
Name
Order
Citations
PageRank
Ahmed Elnably1343.08
Kai Du2182.52
Peter J. Varman370083.23