Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Hybrid dual-objective parallel genetic algorithm for heterogeneous multiprocessor scheduling

Published: 01 June 2020 Publication History

Abstract

Scheduling is a process of mapping resources to tasks and it’s objective is either one or more. This paper focuses on scheduling in heterogeneous multiprocessor systems. Here the resources are processing elements and tasks are the jobs submitted to the processor. The main objectives of multiprocessor scheduling are reducing schedule length, reducing the overall energy consumption, reducing the temperature, reducing failure rates and so on. A Hybrid dual-objective parallel genetic algorithm is applied in the proposed work. Makespan and energy consumption are the two objectives considered. The proposed algorithm determines the global optimal solutions by generating the initial population using some heuristics and then performing parallel genetic operations on it. The main aim of employing parallelism is to find a global optimum solution by avoiding premature convergence in a local optimum and to reduce the running time of the algorithm. Hill climbing is also used in addition, to avoid local optimum solutions. The proposed algorithm balances the tradeoff between energy consumption and makespan according to the inclinations of the users by following weighted sum methodology. Our experimental results demonstrate that the proposed algorithm outperforms the other existing algorithms in terms of both makespan and energy consumption by incurring less running time.

References

[1]
Garey MR and Johnson DS Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) 1979 1 San Francisco, CA Freeman
[2]
Kwok YK and Ahmad I Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Comput. Surv. 1999 31 4 406-471
[3]
Young, B.D., Pasricha, S. et al.: Heterogeneous energy and makespan constrained DAG scheduling. Workshop on Energy Efficient High Performance Parallel and Distributed Computing, EEHPDC, pp. 3–12 (2013)
[4]
Singh J, Mangipudi B, Betha S, and Auluck N Contention aware energy efficient scheduling on heterogeneous multiprocessors IEEE Trans. Parallel Distrib. Syst. 2015 26 5 1251-1264
[5]
Yi J, Zhuge Q, Hu J, Gu S, Qin M, and Sha EHM Reliability—guaranteed task assignment and scheduling for heterogeneous multiprocessors considering timing constraint Springer J. Signal Process. Syst. 2015 81 3 359-375
[6]
Zhang YW, Wang C, and Liu J Energy aware fixed priority scheduling for real time sporadic task with task synchronization J. Syst. Architect. 2018 83 12-22
[7]
Chen J, Li K, Tang Z, Liu C, Wang Y, and Li K Data-aware task scheduling on heterogeneous hybrid memory multiprocessor systems Concurr. Comput. Pract. Exp. 2016 28 17 4443-4459
[8]
Kuo C-F and Lu Y-F Task assignment with energy efficient considerations for non DVS heterogeneous multiprocessor systems Appl. Comput. Rev. 2014 14 4 8-18
[9]
Chatterjee N, Paul S, and Chattopadhyay S Task mapping and scheduling for network-on-chip based multi-core platform with transient faults J. Syst. Architect. 2018 83 34-56
[10]
Mei, J., Li, K.: Energy-aware scheduling algorithm with duplication on heterogeneous computing systems. In: Proc. ACM/IEEE 13th Int. Conf. Grid Comput., pp. 122–129 (2012)
[11]
Zhang Y et al. Energy-efficient tasks scheduling heuristics with multi-constraints in virtualized clouds J. Grid Comput. 2018 16 3 459-475
[12]
Saroja S et al. Multi-criteria decision making for heterogeneous multiprocessor scheduling Int. J. Inf. Technol. Decis. Mak. 2018 17 5 1399-1427
[13]
Saroja S et al. Multi-objective league championship algorithm for real-time task scheduling Neural Comput. Appl. 2019
[14]
Izadkhah H Learning based genetic algorithm for task graph scheduling Appl. Comput. Intell. Soft Comput. 2019
[15]
Jocksam G et al. Genetic and static algorithm for task scheduling in cloud computing Int. J. Cloud Comput. 2019 8 1 1-19
[16]
Yin, S., Ke, P., Tao, L.: An improved genetic algorithm for task scheduling in cloud computing. In: 13th IEEE Conference on Industrial Electronics and Applications (ICIEA) (2018). 10.1109/iciea.2018.8397773
[17]
Vaidehi V, Krishnan CN, and Swaminathan P An aided genetic algorithm for multiprocessor scheduling Parallel Process. Lett. 1999 9 3 423-436
[18]
Daoud MI and Kharma N A hybrid heuristic—genetic algorithm for task scheduling in heterogeneous processor networks J. Parallel Distrib. Comput. 2011 71 1518-1531
[19]
Hou ESH, Ansari N, and Ren H A genetic algorithm for multiprocessor scheduling IEEE Trans. Parallel Distrib. Syst. 1994 5 2 113-120
[20]
Alba E, Nebro AJ, and Troya JMHeterogeneous computing and parallel genetic algorithmsJ. Parallel Distrib. Comput.2002621362-13851063.68104
[21]
Miihlenbein H, Schomisch M, and Born JThe parallel genetic algorithm as function optimizerParallel Comput.199117619-6320735.65040
[22]
Hea H, Sýkoraa O, Salagean A, and Mäkinen E Parallelisation of genetic algorithms for the 2-page crossing number problem J. Parallel Distrib. Comput. 2007 67 229-241
[23]
Dussa-Zieger K and Schwehm MScheduling of parallel programs on configurable multiprocessors by genetic algorithmsInt. J. Approx. Reason.19981923-381047.68521
[24]
Konfrst, Z.: Parallel genetic algorithms: advances, computing trends, applications and perspectives. In: 18th International Parallel and Distributed Processing (2004)
[25]
Gustafson S and Burke EKThe speciating island model: an alternative parallel evolutionary algorithmJ. Parallel Distrib. Comput.2006661025-10361102.68730
[26]
Dubois LE, Marchal L, Sinnen O, and Vivien F Parallel scheduling of task trees with limited memory ACM Trans. Parallel Comput. 2015 2 2 36
[27]
Mitchell, M.: Genetic algorithms: an overview. In: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1995)
[28]
Topcuoglu H, Hariri S, and Wu M Performance-effective and low-complexity task scheduling for heterogeneous computing IEEE Trans. Parallel Distrib. Syst. 2002 13 3 260-274
[29]

Cited By

View all
  • (2023)Low-complex resource mapping heuristics for mobile and iot workloads on NoC-HMPSoC architectureMicroprocessors & Microsystems10.1016/j.micpro.2023.10480298:COnline publication date: 1-Apr-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Cluster Computing
Cluster Computing  Volume 23, Issue 2
Jun 2020
1079 pages

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 June 2020
Accepted: 17 April 2019
Revision received: 15 March 2019
Received: 14 November 2018

Author Tags

  1. Dual-objective
  2. Parallel genetic algorithm
  3. Scheduling

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Low-complex resource mapping heuristics for mobile and iot workloads on NoC-HMPSoC architectureMicroprocessors & Microsystems10.1016/j.micpro.2023.10480298:COnline publication date: 1-Apr-2023

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media