A genetic algorithm-based method for optimizing the energy consumption and performance of multiprocessor systems

被引:0
作者
Anju S. Pillai
Kaumudi Singh
Vijayalakshmi Saravanan
Alagan Anpalagan
Isaac Woungang
Leonard Barolli
机构
[1] Amrita University,Department of Electrical and Electronics Engineering, Amrita School of Engineering, Amrita Vishwa Vidyapeetham
[2] Indian Institute of Science,Department of Electronic System Engineering
[3] University of Waterloo,Department of Electrical and Computer Engineering
[4] Ryerson University,Department of Electrical and Computer Engineering
[5] Ryerson University,Department of Computer Science
[6] Fukuoka Institute of Technology (FIT),Department of Information and Communication Engineering Faculty of Information Engineering
来源
Soft Computing | 2018年 / 22卷
关键词
Multi-objective optimization; Genetic algorithm (GA); Multiprocessor systems; Task graph; Task scheduling; Energy optimization; Schedule length minimization;
D O I
暂无
中图分类号
学科分类号
摘要
In a multiprocessor system, scheduling is an NP-hard problem, and solving it using conventional techniques demands the support of evolutionary algorithms such as genetic algorithms (GAs). Handling the energy consumption issues, while delivering the desired performance for a system, is also a challenging task. In order to achieve these goals, this paper proposes a GA-based method for optimizing the energy consumption and performance of multiprocessor systems using a weighted-sum approach. A performance optimization algorithm with two different selection operators, namely the proportional roulette wheel selection (PRWS) and the rank-based roulette wheel selection (RRWS), is proposed, and the impact of adding elitism in the GA is investigated. Simulation results show that for a specific task graph, using the considered selection operators with elitism yields, respectively, 16.80, 17.11 and 17.82% reduction in energy consumption with a deviation in finish time of 2.08, 2.01 and 1.76 ms when an equal weight factor of 0.5 is considered. This confirms that the selection operator RRWS is superior to PRWS. It is also seen that using elitism enhances the optimization procedure. For a given specific workload, the average percentage reduction in energy consumption with varying weight vector is in the range 12.57–19.51%, with a deviation in finish time of the schedule varying between 1.01 and 2.77 ms.
引用
收藏
页码:3271 / 3285
页数:14
相关论文
共 34 条
[1]  
Bonyadi MR(2009)Bipartite genetic algorithm for multi-processor task scheduling Int J Parallel Program 37 462-487
[2]  
Moghaddam ME(2015)Improved approximation algorithms for scheduling parallel jobs on identical clusters Theor Comput Sci 600 70-85
[3]  
Bougeret M(2014)Energy optimization for real-time multiprocessor system-on-chip with optimal DVFS and DPM combination ACM Trans Embed Comput Syst 13 1-21
[4]  
Dutot P-F(2006)Multiobjective optimization and evolutionary algorithms for the application mapping problem in multiprocessor system-on-chip design IEEE Trans Evol Comput 10 358-374
[5]  
Trystram D(2013)Task scheduling of parallel heterogeneous multi-processor systems using genetic algorithm Int J Comput Appl 61 23-27
[6]  
Jansen K(2014)Make-span minimization for parallel machines scheduling with multiple availability constraints Ann Oper Res 213 173-186
[7]  
Robenek C(2017)Notes on a hierarchical scheduling problem on identical machines Inf Process Lett 120 6-10
[8]  
Chen G(1994)A genetic algorithm for multiprocessor scheduling IEEE Trans Parallel Distrib Syst 5 113-120
[9]  
Huang K(1994)A genetic algorithm for multiprocessor scheduling IEEE Trans Parallel Distrib Syst 5 113-120
[10]  
Knoll A(2016)LBBA: an efficient online benefit-aware multiprocessor scheduling for QoS via online choice of approximation algorithms Future Genern Comput Syst 59 125-135