Skip to main content

Advertisement

Log in

Benchmarking the contention aware nature inspired metaheuristic task scheduling algorithms

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In this paper, we consider the contention aware task scheduling problem on a grid topology of processors. By contention awareness, we mean that simultaneous communication on a link has to be serialized. To solve this problem, we propose several nature inspired metaheuristic algorithms: Simulated Annealing (SA), Genetic Algorithm (GA), Differential Evolution (DE), Particle Swarm Optimization (PSO), Bat Algorithm (BA), Cuckoo Search (CS), and Firefly Algorithm (FA). We perform benchmark evaluation of these algorithms for the Normalized Schedule Length (NSL) parameter. The benchmark task graphs that we consider are: random task graphs, peer set task graphs, systolic array task graphs, Gaussian elimination task graphs, divide and conquer task graphs, and fast Fourier transform task graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Mishra, A., Tripathi, A.K.: Complexity of a problem of energy efficient real-time task scheduling on a multicore processor. Complexity 21(1), 259–267 (2015)

    Article  MathSciNet  Google Scholar 

  2. Mishra, A., Tripathi, A.K.: Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling. Appl. Math. Model. 38, 3456–3466 (2014)

    Article  MathSciNet  Google Scholar 

  3. Mishra, A., Tripathi, A.K.: A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling. Appl. Math. Model. 38, 1929–1947 (2014)

    Article  MathSciNet  Google Scholar 

  4. Mishra, A., Mishra, P.K.: A randomized scheduling algorithm for multiprocessor environments using local search. Parallel Process. Lett. 26, 1650002 (2016)

    Article  MathSciNet  Google Scholar 

  5. Mishra, P.K., Mishra, A., Mishra, K.S., Tripathi, A.K.: Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules. Appl. Math. Model. 36, 6243–6263 (2012)

    Article  MathSciNet  Google Scholar 

  6. Mishra, P.K., Mishra, K.S., Mishra, A., Tripathi, A.K.: A randomized scheduling algorithm for multiprocessor environments. Parallel Process. Lett. 22(4), 1250015 (2012)

    Article  MathSciNet  Google Scholar 

  7. Mishra, P.K., Mishra, K.S., Mishra, A.: A clustering algorithm for multiprocessor environments using dynamic priorities of modules. Ann. Math. Informaticae 38, 99–110 (2011)

    MATH  Google Scholar 

  8. Mishra, A., Tripathi, A.K.: An extension of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme. J. Inf. Comput. Sci. 6(2), 83–96 (2011)

    Google Scholar 

  9. Mishra, A., Tripathi, A.K.: Energy efficient task scheduling of send-receive task graphs on distributed multi-core processors with software controlled dynamic voltage scaling. Int. J. Comput. Sci. Inf. Technol. 3(2), 204–210 (2011)

    Google Scholar 

  10. Mishra, P.K., Mishra, K.S., Mishra, A.: A clustering heuristic for multiprocessor environments using computation and communication loads of modules. Int. J. Comput. Sci. Inf. Technol. 2(5), 170–182 (2010)

    Google Scholar 

  11. Li, D., Wu, J.: Energy-efficient contention-aware application mapping and scheduling on NoC-based MPSoCs. J. Parallel Distrib. Comput. 96, 1–11 (2016)

    Article  Google Scholar 

  12. Abdel-Basset, M., Manogaran, G., El-Shahat, D., Mirjalili, S.: A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener. Comput. Syst. 85, 129–145 (2018)

    Article  Google Scholar 

  13. Abdel-Basset, M., Manogaran, G., Rashad, H., Zaied, A.N.H.: A comprehensive review of quadratic assignment problem: variants, hybrids and applications. J. Ambient Intell. Humaniz. Comput. 1–24 (2018)

  14. Abdel-Basset, M., Manogaran, G., Abdel-Fatah, L., Mirjalili, S.: An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems. Personal Ubiquitous Comput. 1–16 (2018)

  15. Abdel-Basset, M., Shawky, L.A.: Flower pollination algorithm: a comprehensive review. Artif. Intell. Rev. 1–25 (2018)

  16. Cerny, V.: A thermodynamical approach to the traveling salesman problem: an efficient simulated annealing algorithm. J. Optim. Theory Appl. 45, 41–51 (1985)

    Article  MathSciNet  Google Scholar 

  17. Benten, M.S.T., Sait, S.M.: Genetic scheduling of task graphs. Int. J. Electron. 77(4), 401–405 (1994)

    Article  Google Scholar 

  18. Yang, X.S.: Bat algorithm for multi-objective optimisation. Int. J. Bioinspired Comput. 3(5), 267–274 (2011)

    Article  Google Scholar 

  19. Abdel-Basset, M., Zhou, Y., Ismail, M.: An improved cuckoo search algorithm for integer programming problems. Int. J. Comput. Sci. Math. 9(1), 66–81 (2018)

    Article  MathSciNet  Google Scholar 

  20. Abdel-Basset, M., Shawky, L.A., Sangaiah, A.K.: A comparative study of cuckoo search and flower pollination algorithm on solving global optimization problems. Library Hi Tech 35(4), 588–601 (2017)

    Article  Google Scholar 

  21. Abdel-Basset, M., Wang, G.G., Sangaiah, A.K., Rushdy, E.: Krill herd algorithm based on cuckoo search for solving engineering optimization problems. Multimed. Tools Appl. 1–24 (2017)

  22. Yang, X.S., Deb, S.: Engineering optimisation by Cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330–343 (2009)

    MATH  Google Scholar 

  23. She Yang, X.: Firefly algorithm, stochastic test functions and design optimisation. Int. J. Bio-Inspired Comput. 2(2), 78–84 (2010)

    Article  Google Scholar 

  24. Sinnen, O.: Task Scheduling for Parallel Systems. Wiley, New York (2007)

    Book  Google Scholar 

  25. Yang, X.S.: Nature-Inspired Metaheuristic Algorithms, 2nd edn. Luniver Press, Frome (2010)

    Google Scholar 

  26. Kirkpatrick, S., Gelatt, C.D., Vecchi, P.M.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  27. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand-Reinhold, New York (1991)

    Google Scholar 

  28. Storn, R., Price, K.V.: Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)

    Article  MathSciNet  Google Scholar 

  29. Price, K., Storn, R., Lampinen, J.: Differential Evolution—A Practical Approach to Global Optimization. Springer, Berlin (2005)

    MATH  Google Scholar 

  30. Tasgetiren, M.F., Liang, Y., Sevkli, M., Gencyilmaz, G.: Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. Int. J. Prod. Res 44(22), 4737–4754 (2006)

    Article  Google Scholar 

  31. Kennedy, J., Eberharl, R. C.: Particle Swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, Perth, Australia, (1995), pp. 1942–1948

  32. Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Academic Press, Cambridge (2001)

    Google Scholar 

  33. Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Nature Inspired Cooperative Strategies for Optimization (NICSO 2010) pp. 65–74 (2010)

  34. Abdel-Basset, M., Hessin, A.N., Abdel-Fatah, L.: A comprehensive study of Cuckoo-inspired algorithms. Neural Comput. Appl. 29(2), 345–361 (2018)

    Article  Google Scholar 

  35. Yang, X. S., Deb, S.: Cuckoo search via Levy Flights. In: Nature & Biologically Inspired Computing (NaBIC 2009), pp. 210–214 (2009)

  36. Yang, X. S.: Firefly algorithm, Levy flights and global optimization. In: Research and Development in Intelligent Systems XXVI, pp. 209–218. Springer, New York (2010)

  37. Muthurajkumar, S., Vijayalakshmi, M., Kannan, A., Ganapathy, S.: Optimal and energy efficient scheduling techniques for resource management in public cloud networks. Natl. Acad. Sci. Lett. 41(4), 219–223 (2018)

    Article  MathSciNet  Google Scholar 

  38. Mao, L., Li, Y., Peng, G., Xu, X., Lin, W.: A multi-resource task scheduling algorithm for energy-performance trade-offs in green clouds. Sust. Comput. 19, 233–241 (2018)

    Google Scholar 

  39. Yang, J., Jiang, B., Lv, Z., Choo, K.K.R.: A task scheduling algorithm considering game theory designed for energy management in cloud computing. Future Gener. Comput. Syst. (2017). https://doi.org/10.1016/j.futu

Download references

Acknowledgements

The authors would like to thank the anonymous referees for giving valuable comments and suggestions to revise the manuscript in the present form.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abhishek Mishra.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mishra, A., Trivedi, P. Benchmarking the contention aware nature inspired metaheuristic task scheduling algorithms. Cluster Comput 23, 537–553 (2020). https://doi.org/10.1007/s10586-019-02943-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-019-02943-z

Keywords

Navigation