Search
Comparison of selected algorithms for scheduling workflow applications with dynamically changing service availability
Abstract
This paper compares the quality and execution times of several algorithms for scheduling service based workflow applications with changeable service availability and parameters. A workflow is defined as an acyclic directed graph with nodes corresponding to tasks and edges to dependencies between tasks. For each task, one out of several available services needs to be chosen and scheduled to minimize the workflow execution time and keep the cost of service within the budget. During the execution of a workflow, some services may become unavailable, new ones may appear, and costs and execution times may change with a certain probability. Rescheduling is needed to obtain a better schedule. A solution is proposed on how integer linear programming can be used to solve this problem to obtain optimal solutions for smaller problems or suboptimal solutions for larger ones. It is compared side-by-side with GAIN, divide-and-conquer, and genetic algorithms for various probabilities of service unavailability or change in service parameters. The algorithms are implemented and subsequently tested in a real BeesyCluster environment.
Citations
-
2
CrossRef
-
0
Web of Science
-
4
Scopus
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
Journal of Zhejiang University-SCIENCE C-Computers & Electronics
no. 15,
pages 401 - 422,
ISSN: 1869-1951 - Language:
- English
- Publication year:
- 2014
- Bibliographic description:
- Czarnul P.: Comparison of selected algorithms for scheduling workflow applications with dynamically changing service availability// Journal of Zhejiang University-SCIENCE C-Computers & Electronics. -Vol. 15, nr. 6 (2014), s.401-422
- DOI:
- Digital Object Identifier (open in new tab) 10.1631/jzus.c1300270
- Verified by:
- Gdańsk University of Technology
seen 102 times