An experimental study of workflow scheduling algorithms for heterogeneous systems

8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper studies the efficiency of nine state-of-the-art algorithms for scheduling of workflow applications in heterogeneous computing systems (HCS). The comparison of algorithms is performed on the base of discrete-event simulation for a wide range of workflow and system configurations. The developed open source simulation framework based on SimGrid toolkit allowed us to perform a large number of experiments in a reasonable amount of time and to ensure reproducible results. The accuracy of the used network model helped to reveal drawbacks of simpler models commonly used for studying scheduling algorithms.

Cite

CITATION STYLE

APA

Nazarenko, A., & Sukhoroslov, O. (2017). An experimental study of workflow scheduling algorithms for heterogeneous systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10421 LNCS, pp. 327–341). Springer Verlag. https://doi.org/10.1007/978-3-319-62932-2_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free