Advertisement

Multi-objective league championship algorithm for real-time task scheduling

  • Saroja SubbarajEmail author
  • Revathi Thiagarajan
  • Madavan Rengaraj
Original Article
  • 17 Downloads

Abstract

League championship algorithm is a recently proposed population-based evolutionary algorithm for finding global optimal solutions in continuous optimization problems. The proposed work adopts the algorithm by modifying the team formation step for solving real-time task scheduling problem in heterogeneous multiprocessors. Two different objectives: tardiness and energy consumption were considered for scheduling. Our proposed algorithm is implemented using Java and tested using the graphs generated by the benchmark tools: task graph for free and task graph generator. Simulation results prove the performance of the proposed algorithm is better in terms of the objective functions over the other existing metaheuristic algorithms such as genetic algorithm, ant colony optimization and particle swarm optimization.

Keywords

Heterogeneous multiprocessors Global optimum Scheduling 

Notes

Conflict of interest

There is no potential conflicts of interest.

References

  1. 1.
    Kumar R, et al (2006) Core architecture optimization for heterogeneous chip multiprocessors. PACT’06, September 2006Google Scholar
  2. 2.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness (Series of books in the mathematical sciences), 1st edn. Freeman, San FranciscozbMATHGoogle Scholar
  3. 3.
    Bansal S et al (2005) Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs. J Parallel Distrib Comput 65:479–491zbMATHGoogle Scholar
  4. 4.
    Topcuoglu H et al (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260–274Google Scholar
  5. 5.
    Daoud MT, Kharma N (2008) A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J Parallel Distrib Comput 68:399–409zbMATHGoogle Scholar
  6. 6.
    Saroja S et al (2018) Multi-criteria decision making for heterogeneous multiprocessor scheduling. Int J Inf Technol Decis Mak 17(5):1399–1427Google Scholar
  7. 7.
    Singh J et al (2015) Contention aware energy efficient scheduling on heterogeneous multiprocessors. IEEE Trans Parallel Distrib Syst 26(5):1251–1264Google Scholar
  8. 8.
    Liu W, et al (2012) An energy efficient clustering-based scheduling algorithm for parallel tasks on homogeneous DVS-enabled clusters. In: Proceedings of IEEE 16th international conference on computer supported cooperative work in design, pp 575–582Google Scholar
  9. 9.
    Boeres C, Rebello VEF (2002) Cluster-based static scheduling: theory and practice. In: Proceedings of 14th symposium on computer architecture and high performance computing (SBAC-PAD’02)Google Scholar
  10. 10.
    Palmer A, Sinnen O (2008) Scheduling algorithm based on force directed clustering. In: Proceedings of ninth international conference on parallel and distributed computing, applications and technologies, pp 311–318Google Scholar
  11. 11.
    Bajaj R, Agrawal DP (2004) Improving scheduling of tasks in a heterogeneous environment. IEEE Trans Parallel Distrib Syst 15(2):107–118Google Scholar
  12. 12.
    Ranaweera S, Agrawal DP (2000) A task duplication based scheduling algorithm for heterogeneous systems. In: Proceedings of 14th internatioanl parallel distribution process symposium, pp 445–450Google Scholar
  13. 13.
    Kwok YK, Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput Surv 31:406–471Google Scholar
  14. 14.
    Kwok Y, Ahmad I (1994) A static scheduling algorithm using dynamic critical path for assigning parallel algorithms onto multiprocessors. Proc Int Conf Parallel Process II:155–159Google Scholar
  15. 15.
    Yang J et al (2008) A static multiprocessor scheduling algorithm for arbitrary directed task graphs in uncertain environments. Lect Notes Comput Sci 5022:18–29Google Scholar
  16. 16.
    Topcuoglu H, et al (1999) Task scheduling algorithms for heterogeneous processors. In: Proceedings of eighth heterogeneous computing workshop 1999 (HCW ‘99) pp 3–14Google Scholar
  17. 17.
    Qiao Y et al (2001) A new dynamic scheduling algorithm for real-time multiprocessor systems. Int Fed Inf Process 61:112–115Google Scholar
  18. 18.
    Manimaran G, Murthy CSR (1998) An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Trans Parallel Distrib Syst 9(3):312–319Google Scholar
  19. 19.
    Gairing M et al (2007) A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor Comput Sci 387:87–99MathSciNetzbMATHGoogle Scholar
  20. 20.
    Young BD et al (2013) Heterogeneous energy and makespan constrained DAG scheduling. EEHPDC’ 13:3–11Google Scholar
  21. 21.
    Yi J et al (2015) Reliability—guaranteed task assignment and scheduling for heterogeneous multiprocessors considering timing constraint. J Signal Process Syst 81(3):359–375Google Scholar
  22. 22.
    Vaidehi V, Krishnan CN, Swaminathan P (1999) An aided genetic algorithm for multiprocessor scheduling. Parallel Process Lett 9(3):423–436Google Scholar
  23. 23.
    Daoud MI, Kharma N (2011) A hybrid heuristic—genetic algorithm for task scheduling in heterogeneous processor networks. J Parallel Distrib Comput 71:1518–1531Google Scholar
  24. 24.
    Hou ESH, Ansari N, Ren H (1994) A genetic algorithm for multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 5(2):113–120Google Scholar
  25. 25.
    Boeres C, Sardina IM, Drummond LMA (2011) An efficient weighted bi-objective scheduling algorithm for heterogeneous systems. J Parallel Comput 37:349–364Google Scholar
  26. 26.
    Alba E, Nebro AJ, Troya JM (2002) Heterogeneous computing and parallel genetic algorithms. J Parallel Distrib Comput 62:1362–1385zbMATHGoogle Scholar
  27. 27.
    Miihlenbein H, Schomisch M, Born J (1991) The parallel genetic algorithm as function optimizer. Parallel Comput 17:619–632zbMATHGoogle Scholar
  28. 28.
    Hea Hongmei, Sýkoraa Ondrej, Salagean Ana, Mäkinen E (2007) Parallelisation of genetic algorithms for the 2-page crossing number problem. J Parallel Distrib Comput 67:229–241Google Scholar
  29. 29.
    Dussa-Zieger Klaudia, Schwehm Markus (1998) Scheduling of parallel programs on configurable multiprocessors by genetic algorithms. Int J Approx Reason 19:23–38zbMATHGoogle Scholar
  30. 30.
    Zhang W, et al (2014) Energy-aware real-time task scheduling for heterogeneous multiprocessors with particle swarm optimization algorithm. Math Probn Eng.  https://doi.org/10.1155/2014/287475
  31. 31.
    Vidyarthi DP, Singh SK (2015) Independent tasks scheduling using parallel PSO in multiprocessor systems. Int J Grid High Perform Comput 7(2):1–17Google Scholar
  32. 32.
    Boveiri HR (2016) A novel ACO-based static task scheduling approach for multiprocessor environments. Int J Comput Intell Syst 9(5):800–811.  https://doi.org/10.1080/18756891.2016.1237181 Google Scholar
  33. 33.
    Boveiri HR (2017) An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling. Front Inf Technol Electron Eng 18(4):498–510Google Scholar
  34. 34.
    Kaur S et al (2017) Parallel job scheduling using grey wolf optimization algorithm for heterogeneous multi-cluster environment. Int J Comput Sci Eng 5(10):44–53Google Scholar
  35. 35.
    Eswari R et al (2015) Effective task scheduling for heterogeneous distributed systems using firefly algorithm. Int J Comput Sci Eng 11(2):132–142Google Scholar
  36. 36.
    Eswari R et al (2016) Modified multi-objective firefly algorithm for task scheduling problem on heterogeneous systems. Int J Bio-Inspired Comput 8(6):379–393Google Scholar
  37. 37.
    Kashan HA (2009) League championship algorithm: a new algorithm for numerical function optimization. In: Soft computing and pattern recognition, SOCPAR’09, pp 43–48Google Scholar
  38. 38.
    Kashan HA (2014) League championship algorithm (LCA): an algorithm for global optimization inspired by sport championships. Appl Soft Comput 16:171–200Google Scholar
  39. 39.
    Sebastián AR, Isabel LR (2014) Scheduling to job shop configuration minimizing the makespan using champions league algorithm, Fray Ismael Leonardo Ballesteros Guerrero, OP-Decano de División de Arquitectura e Ingenierías, Universidad Santo Tomás Seccional TunjaGoogle Scholar
  40. 40.
    Abdulhamid SM, Latiff MSA (2017) A checkpointed league championship algorithm-based cloud scheduling scheme with secure fault tolerance responsiveness. Appl Soft Comput 61:670–680Google Scholar
  41. 41.
    Lenin K et al (2013) League championship algorithm (LCA) for solving optimal reactive power dispatch problem. Int J Comput Inf Technol 1:1–19Google Scholar
  42. 42.
    KS (2014) A league championship algorithm for travelling salesman problem. Azad University, Najaf Abad Branch, Iran (in Persian)Google Scholar
  43. 43.
    Yadav S, Nanda SJ (2015) League championship algorithm for clustering. In: IEEE power, communication and information technology conference (PCITC), pp 321–326Google Scholar
  44. 44.
    Saraswathi D, Srinivasan E (2017) Mammogram analysis using league championship algorithm optimized ensembled FCRN classifier. Indones J Electr Eng Comput Sci 5(2):451–461Google Scholar
  45. 45.
    Jalili S et al (2017) League championship algorithms for optimum design of pin-jointed structures. J Comput Civ Eng 31(2):1–17MathSciNetGoogle Scholar
  46. 46.
    Alimoradi MR, Kashan AH (2018) A league championship algorithm equipped with network structure and backward Q-learning for extracting stock trading rules. Appl Soft Comput 68:478–493Google Scholar
  47. 47.
    Wangchamhan T et al (2017) Efficient algorithms based on the k-means and chaotic league championship algorithm for numeric, categorical, and mixed-type data clustering. Expert Syst Appl 90:146–167Google Scholar
  48. 48.
    Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26:369–395MathSciNetzbMATHGoogle Scholar
  49. 49.
    “Task graph generator” (2012). [Online]. Available: http://taskgraphgen.sourceforge.net
  50. 50.
    Dick RP, Rhodes DL, Wolf W (1998) TGFF: task graphs for free. In: Proceedings of 6th international workshop hardware/software codes, pp 97–101Google Scholar
  51. 51.
    Zong Z, Manzanares A, Ruan X, Qin X (2011) “EAD and PEBD:two energy-aware duplication scheduling algorithms for parallel tasks on homogeneous clusters. IEEE Trans Comput 60(3):360–374MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Information TechnologyMepco Schlenk Engineering CollegeSivakasiIndia
  2. 2.Department of Electrical and Electronics EngineeringPSR Engineering CollegeSivakasiIndia

Personalised recommendations