Different aspects of workflow scheduling in large-scale distributed systems

Research Projects
Organizational Units
Journal Issue
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.
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
Bibliographic citation
Stavrinides, G.L., Rodrigo Duro, F., Karatza, H., García Blas, J., Carretero, J. (2017). Different aspects of workflow scheduling in large-scale distributed systems. Simulation Modelling Practice and Theory, 70, pp. 120-134.