TY - GEN
T1 - A t-level driven search for estimation of distribution algorithm in solving task graph allocation to multiprocessors
AU - Wu, Chu Ge
AU - Wang, Ling
AU - Wang, Jing Jing
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/1
Y1 - 2017/7/1
N2 - The development of cloud computing drives the research on parallel processing. One of the important problems in parallel processing is to minimize the makespan of the tasks with precedence constraints on multiprocessors scheduling. In this paper, the property of the t-level (top-level) is analyzed, and a t-level (top level) driven search is proposed to enhance the exploitation ability of the efficient estimation of distributed algorithm (eEDA), which was developed for solving the precedence constrained scheduling problem. Numerical tests and comparisons are carried out. The results demonstrate that the t-level driven search is able to improve the optimization capacity of the eEDA under heterogeneous multiprocessor situation. Moreover, it is also shown that the eEDA with the t-level driven search on homogeneous computing systems is effective.
AB - The development of cloud computing drives the research on parallel processing. One of the important problems in parallel processing is to minimize the makespan of the tasks with precedence constraints on multiprocessors scheduling. In this paper, the property of the t-level (top-level) is analyzed, and a t-level (top level) driven search is proposed to enhance the exploitation ability of the efficient estimation of distributed algorithm (eEDA), which was developed for solving the precedence constrained scheduling problem. Numerical tests and comparisons are carried out. The results demonstrate that the t-level driven search is able to improve the optimization capacity of the eEDA under heterogeneous multiprocessor situation. Moreover, it is also shown that the eEDA with the t-level driven search on homogeneous computing systems is effective.
KW - estimation of distribution algorithm
KW - parallel computing system
KW - t-level
KW - task graph allocation
UR - http://www.scopus.com/inward/record.url?scp=85044925141&partnerID=8YFLogxK
U2 - 10.1109/COASE.2017.8256173
DO - 10.1109/COASE.2017.8256173
M3 - Conference contribution
AN - SCOPUS:85044925141
T3 - IEEE International Conference on Automation Science and Engineering
SP - 630
EP - 635
BT - 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017
PB - IEEE Computer Society
T2 - 13th IEEE Conference on Automation Science and Engineering, CASE 2017
Y2 - 20 August 2017 through 23 August 2017
ER -