DocumentCode :
2320398
Title :
Reward Scheduling for QoS in Cloud Applications
Author :
Elnably, Ahmed ; Du, Kai ; Varman, Peter
Author_Institution :
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
fYear :
2012
fDate :
13-16 May 2012
Firstpage :
98
Lastpage :
106
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.
Keywords :
client-server systems; cloud computing; hard discs; processor scheduling; quality of service; software performance evaluation; storage management; QoS scheduling algorithm; RAP; SSD; access times; application performance tuning; cloud applications; dynamically varying workloads; hard disks; multitiered storage servers; reward allocation policy; reward scheduling; runtime behavior; static QoS settings; Performance evaluation; Quality of service; Resource management; Scheduling algorithms; Servers; Synchronization; Throughput; QoS; cloud; multi-tier storage; performance isolation; scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cluster, Cloud and Grid Computing (CCGrid), 2012 12th IEEE/ACM International Symposium on
Conference_Location :
Ottawa, ON
Print_ISBN :
978-1-4673-1395-7
Type :
conf
DOI :
10.1109/CCGrid.2012.120
Filename :
6217410
Link To Document :
بازگشت