Using Simulation to Improve Workflow Scheduling in Heterogeneous Computing Systems

  • Alexey Nazarenko
  • Oleg SukhoroslovEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 793)


Workflows is an important class of parallel applications that consist of many tasks with logical or data dependencies. A multitude of scheduling algorithms have been proposed to optimize the workflow execution in heterogeneous computing systems. However, in order to be efficiently applied in practice, these algorithms require accurate estimates of task execution and communication times. In this paper two modifications of the well-known HEFT algorithm are investigated that use simulation instead of simple analytical models in order to better estimate data transfer times. The results of experimental study show that the proposed approach can improve makespan for data-intensive workflows with high parallelism and communication-to-computation ratio.


Workflow Scheduling Simulation Heterogeneous systems Distributed computing 



This work is supported by the Russian Foundation for Basic Research (projects 15-29-07068, 15-29-07043).


  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: 1998 Seventh Heterogeneous Computing Workshop, 1998, (HCW 98) Proceedings, 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 lookahead 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: 1998 Seventh Heterogeneous Computing Workshop, 1998, (HCW 98) Proceedings, 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. Discrete Math. 5, 287–326 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Hagras, T., Janecek, J.: A simple scheduling heuristic for heterogeneous computing environments. In: 2003 Second International Symposium on Parallel and Distributed Computing, Proceedings, pp. 104–110, October 2003Google Scholar
  11. 11.
    Hockney, R.W.: The communication challenge for MPP: intel paragon and Meiko CS-2. Parallel Comput. 20(3), 389–398 (1994)CrossRefGoogle Scholar
  12. 12.
    Hunold, S., Rauber, T., Suter, F.: Scheduling dynamic workflows onto clusters of clusters using postponing. In: 2008 8th IEEE International Symposium on Cluster Computing and the Grid, CCGRID 2008, pp. 669–674. IEEE (2008)Google Scholar
  13. 13.
    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: 1999 Proceedings of Eighth Heterogeneous Computing Workshop, (HCW 1999), pp. 30–44. IEEE (1999)Google Scholar
  14. 14.
    Taylor, I.J., Deelman, E., Gannon, D.B., Shields, M.: Workflows for e-Science: Scientific Workflows for Grids. Springer, London (2014)Google 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)CrossRefzbMATHMathSciNetGoogle 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. Studies in Computational Intelligence, vol. 146, pp. 173–214. Springer, Heidelberg (2008).

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