QoS-Based Web Service Scheduling Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm
Data(s) |
2008
|
---|---|
Resumo |
In the filed of semantic grid, QoS-based Web service scheduling for workflow optimization is an important problem.However, in semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the scheduling consider not only quality properties of Web services, but also inter service dependencies which are formed due to the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm, namely minimal-conflict hill-climbing repair genetic algorithm, to address scheduling optimization problems in workflow applications in the presence of domain constraints and inter service dependencies. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm. |
Formato |
application/pdf |
Identificador | |
Relação |
http://eprints.qut.edu.au/28776/1/c28776.pdf http://escience2008.iu.edu/ Ai, Lifeng & Tang, Maolin (2008) QoS-Based Web Service Scheduling Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm. In Proceedings of the 4th IEEE International Conference on eScience, University Place Conference Center & Hotel, Indianapolis. |
Direitos |
Copyright 2008 Please consult the authors. |
Fonte |
Faculty of Science and Technology; Smart Services CRC |
Palavras-Chave | #080500 DISTRIBUTED COMPUTING #080100 ARTIFICIAL INTELLIGENCE AND IMAGE PROCESSING #Web Service #QoS #Genetic Algorithm |
Tipo |
Conference Paper |