A new mapping heuristic based on mean field annealing
Journal of Parallel and Distributed Computing
0743-7315 (Print)1096-0848 (Online)
292 - 305
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/11202
A new mapping heuristic is developed, based on the recently proposed Mean Field Annealing (MFA) algorithm. An e cient implementation scheme, which decreases the complexity of the proposed algorithm by asymptotical factors, is also given. Performance of the proposed MFA algorithm is evaluated in comparison with two wellknown heuristics; Simulated Annealing and Kernighan-Lin. Results of the experiments indicate that MFA can be used as an alternative heuristic for solving the mapping problem. Inherent parallelism of MFA is exploited by designing an e cient parallel algorithm for the proposed MFA heuristic.