Affiliation:
1. Nanjing Audit University
Abstract
Scheduling the workflow in a dynamic environment is an important issues for actual application because of service resources changed dynamically . In this paper, a cost-compensation-based dynamic scheduling algorithm (CCDSA) is constructed for the dynamic service-workflows. Related rules are defined, local re-scheduling workflow is performed by judging the influence range of abnormal nodes. Comparing CCDSA with HPSO, experimental results show that CCDSA obtains satisfied solutions, and has good adaptability and stability.
Publisher
Trans Tech Publications, Ltd.
Reference11 articles.
1. FOSTER I, KESSELMAN C. The Grid: Blueprint for a Future Computing Infrastructure. USA: Morgan Kaufmann Publishers, (1999).
2. FOSTER I, KESSELMAN C, NICK J M, TUECKE S. Grid service for distributed system integration. IEEE computer, 2002, 35(6): 37-46.
3. YU J, BUYYA R. Taxonomy of scientific workflow systems for Grid computing. SIGMOD RECORD 2005, 34 (3): 44- 49.
4. BLYTHE J, JAIN S, DEELMAN E, et al. Task scheduling strategies for workflow-based applications in grids. IEEE International Symposium on Cluster Computing and Grid, Cardiff, Wales. UK, 2005. 759-767.
5. ZHANG Xiao-dong, LI Xiao-ping, WANG Qian, YUAN Ying-chun. Hybrid particle swarm optimization algorithm for cost minimization in service-workflows with due dates. Journal on Communications. 2008, 29: (87-93).