| | |
Summary: A NEW MAPPING
HEURISTIC BASED ON
MEAN FIELD ANNEALING1
Tev k Bultan and Cevdet Aykanat
Department of Computer Engineering and Information Science,
Bilkent University, 06533 Bilkent, Ankara, Turkey
1This work is partially supported by Intel Supercomputer Systems Division under Grant SSD100791-2 and
Turkish Science and Research Council under Grant EEEAG-5.
1
A NEW MAPPING HEURISTIC BASED ON MFA
Abstract
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. Per-
formance of the proposed MFA algorithm is evaluated in comparison with two well-
known heuristics Simulated Annealing and Kernighan-Lin. Results of the exper-
iments 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.
2
|
