An Experimental Study of Workflow Scheduling Algorithms for Heterogeneous Systems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10421)


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.


Distributed computing Heterogeneous systems Scheduling Workflow Simulation 



This work is supported by the Russian Science Foundation (project No. 16-11-10352).


  1. 1.
    Arabnejad, H., Barbosa, J.G.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25(3), 682–694 (2014)CrossRefGoogle Scholar
  2. 2.
    Arabnejad, H., Barbosa, J.G., Prodan, R.: Low-time complexity budget-deadline constrained workflow scheduling on heterogeneous resources. Future Gener. Comput. Syst. 55, 29–40 (2016)CrossRefGoogle Scholar
  3. 3.
    Armstrong, R., Hensgen, D., Kidd, T.: The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. In: Proceedings of 1998 Seventh Heterogeneous Computing Workshop, HCW 1998, pp. 79–87. IEEE (1998)Google Scholar
  4. 4.
    Bharathi, S., Chervenak, A., Deelman, E., Mehta, G., Su, M.H., Vahi, K.: Characterization of scientific workflows. In: 2008 Third Workshop on Workflows in Support of Large-Scale Science, pp. 1–10, November 2008Google Scholar
  5. 5.
    Bittencourt, L.F., Sakellariou, R., Madeira, E.R.M.: Dag scheduling using a look ahead variant of the heterogeneous earliest finish time algorithm. In: 2010 18th Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp. 27–34, February 2010Google Scholar
  6. 6.
    Casanova, H., Giersch, A., Legrand, A., Quinson, M., Suter, F.: Versatile, scalable, and accurate simulation of distributed applications and platforms. J. Parallel Distrib. Comput. 74(10), 2899–2917 (2014)CrossRefGoogle Scholar
  7. 7.
    Chen, W., Deelman, E.: Workflowsim: a toolkit for simulating scientific workflows in distributed environments. In: 2012 IEEE 8th International Conference on E-science (e-science), pp. 1–8. IEEE (2012)Google Scholar
  8. 8.
    Freund, R.F., Gherrity, M., Ambrosius, S., Campbell, M., Halderman, M., Hensgen, D., Keith, E., Kidd, T., Kussow, M., Lima, J.D., et al.: Scheduling resources in multi-user, heterogeneous, computing environments with smartnet. In: Proceedings 1998 Seventh Heterogeneous Computing Workshop, (HCW 1998), pp. 184–199. IEEE (1998)Google Scholar
  9. 9.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Hagras, T., Janecek, J.: A simple scheduling heuristic for heterogeneous computing environments. In: Proceedings of Second International Symposium on Parallel and Distributed Computing, pp. 104–110, October 2003Google Scholar
  11. 11.
    Hunold, S., Rauber, T., Suter, F.: Scheduling dynamic workflows onto clusters of clusters using postponing. In: 8th IEEE International Symposium on Cluster Computing and the Grid, CCGRID 2008, pp. 669–674. IEEE (2008)Google Scholar
  12. 12.
    Maheswaran, M., Ali, S., Siegal, H.J., Hensgen, D., Freund, R.F.: Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: Proceedings of the Eighth Heterogeneous Computing Workshop, (HCW 1999), pp. 30–44. IEEE (1999)Google Scholar
  13. 13.
    Taylor, I.J., Deelman, E., Gannon, D.B., Shields, M.: Workflows for e-Science: Scientific Workflows for Grids. Springer Publishing Company Incorporated, London (2014)Google Scholar
  14. 14.
    Tobita, T., Kasahara, H.: A standard task graph set for fair evaluation of multiprocessor scheduling algorithms. J. Sched. 5(5), 379–394 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002)CrossRefGoogle Scholar
  16. 16.
    Velho, P., Legrand, A.: Accuracy study and improvement of network simulation in the simgrid framework. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, p. 13. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) (2009)Google Scholar
  17. 17.
    Velho, P., Schnorr, L.M., Casanova, H., Legrand, A.: On the validity of flow-level TCP network models for grid and cloud simulations. ACM Trans. Model. Comput. Simul. (TOMACS) 23(4), 23 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Yu, J., Buyya, R., Ramamohanarao, K.: Workflow scheduling algorithms for grid computing. In: Xhafa, F., Abraham, A. (eds.) Metaheuristics for Scheduling in Distributed Computing Environments. SCI, vol. 146, pp. 173–214. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Institute for Information Transmission Problems of the Russian Academy of SciencesMoscowRussia

Personalised recommendations