TY - JOUR
T1 - Deadline-constrained workflow scheduling in volunteer computing systems
AU - Ghafarian, Toktam
AU - Javadi, Bahman
PY - 2013
Y1 - 2013
N2 - One of the main challenges in volunteer computing systems is scheduling large-scale applications expressed as scientific workflows. This work aims to integrate partitioning scientific workflows and proximity-aware resource provisioning to increase the percentage of workflows that meet the deadline in peer-to-peer based volunteer computing systems. In the partitioning phase, a scientific workflow is partitioned into sub-workflows in order to minimize data dependencies among them. We utilize knowledge-free load balancing policy and proximity of resources to distribute sub-workflows on volunteer resources. Simulation results show that the proposed workflow scheduling system improves the percentage of scientific workflows that meet the deadline with average of 18% under a moderate workload.
AB - One of the main challenges in volunteer computing systems is scheduling large-scale applications expressed as scientific workflows. This work aims to integrate partitioning scientific workflows and proximity-aware resource provisioning to increase the percentage of workflows that meet the deadline in peer-to-peer based volunteer computing systems. In the partitioning phase, a scientific workflow is partitioned into sub-workflows in order to minimize data dependencies among them. We utilize knowledge-free load balancing policy and proximity of resources to distribute sub-workflows on volunteer resources. Simulation results show that the proposed workflow scheduling system improves the percentage of scientific workflows that meet the deadline with average of 18% under a moderate workload.
UR - http://handle.uws.edu.au:8081/1959.7/538723
U2 - 10.1007/978-3-319-03859-9_4
DO - 10.1007/978-3-319-03859-9_4
M3 - Article
SN - 0302-9743
VL - 8285
SP - 44
EP - 57
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
IS - PART 1
ER -