loading...
Average-Based Workload Allocation Strategy for QoS-Constrained Jobs In A Web Service-Oriented Grid
Hong Kong, China October 16-October 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EDOCW.2006.2510th IEEE International Enterprise Di ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yash Patel, Imperial College South Kensington Campus, London SW7 2AZ, United Kingdom
John Darlington, Imperial College South Kensington Campus, London SW7 2AZ, United Kingdom
The success of web services has influenced the way in which Grid applications are being written. Web services are increasingly used as a means to realise service-oriented distributed computing. Grid users often submit their applications in the form of workflows with certain Quality of Service (QoS) requirements imposed on the workflows. These workflows detail the composition of web services and the level of service required from the Grid. This paper addresses workload allocation techniques for Grid workflows. We model a web service as a G / G/ k queue and minimise failures (QoS requirement violation) of jobs by solving a mixed-integer non-linear program (MINLP). The novel approach is evaluated through an experimental simulation and the results confirm that the proposed workload allocation strategy performs considerably better in terms of satisfying QoS requirements of Grid workflows than scheduling algorithms that don?t employ such workload allocation techniques.
Citation:
Yash Patel, John Darlington, "Average-Based Workload Allocation Strategy for QoS-Constrained Jobs In A Web Service-Oriented Grid," edocw, pp.11, 10th IEEE International Enterprise Distributed Object Computing Conference Workshops (EDOCW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.