Title :
A CoS-enabled Request Scheduling Policy
Author :
Yang, Yubin ; Tang, Yazhe ; Zhao, Ming ; Yao, Lei
Author_Institution :
Xi¿an Jiaotong University, Xi¿an Shaanxi 710049, China
Abstract :
As a lightweight SLA between service providers and consumers, class of service (CoS) can avoid the runtime overhead brought by multiple negotiation of service agreements. This is especially important in grid environment where lots of transient services exist. We bring CoS into grid environment and propose a QoS-enabled framework named CQEF for grid service. In this paper, we present a CoSenabled request scheduling policy for CoS deployment in CQEF. According to this policy, incoming requests can be identified and classified based on the CoS information attached to them and subsequently be assigned to different waiting queues with different priorities. Besides, queuing scheduling algorithm is used to achieve the CoS enabling purpose. A prototype has been developed over the Globus platform. The test results show that, by using this policy, service providers are able to offer differentiated services for different CoS and QoS of premium CoSs will be guaranteed preferentially.
Keywords :
Admission control; Computer architecture; Monitoring; Processor scheduling; Prototypes; Quality of service; Runtime; Scheduling algorithm; Testing; Web server;
Conference_Titel :
Enterprise Distributed Object Computing Conference Workshops, 2006. EDOCW '06. 10th IEEE International
Conference_Location :
Hong Kong, China
Print_ISBN :
0-7695-2743-4
DOI :
10.1109/EDOCW.2006.6