Parallel loop scheduling using an evolutionary algorithm
Alireza Hajieskandar, Shahriar Lotfi · 2010
Many computational programs use nested loops. Programs run faster if they can execute loops in parallel. Therefore nested loops parallelization is an important problem for increasing of speed-up of program executions. One of underlying stages in parallelization is scheduling tiled space for iterating nested loops. As the problem is a NP-Hard one, using traditional search methods for solving such programs does not fit the case. As a result, heuristic algorithms are suggested for dealing with the problems in question. In this paper, a revolutionary approach, base on bipartite chromosomes is developed. Practical results show that our solution approach which is inspired by heuristics provides better solutions than various alternative solutions in the literature.