Algorithm Mapping with Parallel Simulated Annealing
Abstract
This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by ... where |Np| is the number of task nodes in the mapped program graph Gp and deg(Gp) is the maximal degree of a node in Gp. The mapping algorithm provides a good program mappings (in terms of program execution time and the number of processors used) in a reasonable number of steps.Downloads
Download data is not yet available.
Published
2012-01-27
How to Cite
Robič, B., & Šilc, J. (2012). Algorithm Mapping with Parallel Simulated Annealing. Computing and Informatics, 14(4), 339–351. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/280
Issue
Section
Articles