Different aspects of workflow scheduling in large-scale distributed systems Articles uri icon

publication date

  • January 2017

start page

  • 120

end page

  • 134

volume

  • 70

international standard serial number (ISSN)

  • 1569-190X

electronic international standard serial number (EISSN)

  • 1878-1462

abstract

  • As large-scale distributed systems gain momentum, the scheduling of workflow applications with multiple requirements in such computing platforms has become a crucial area of research. In this paper, we investigate the workflow scheduling problem in large-scale distributed systems, from the Quality of Service (QoS) and data locality perspectives. We present a scheduling approach, considering two models of synchronization for the tasks in a workflow application: (a) communication through the network and (b) communication through temporary files. Specifically, we investigate via simulation the performance of a heterogeneous distributed system, where multiple soft real-time workflow applications arrive dynamically. The applications are scheduled under various tardiness bounds, taking into account the communication cost in the first case study and the I/O cost and data locality in the second.

keywords

  • workflow scheduling; large-scale distributed systems; ultrascale systems; quality of service; data locality; real-time systems; utilizing imprecise computations; multiple task graphs; heterogeneous systems; performance