A new mapping heuristic based on mean field annealing

Date
1992
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Journal of Parallel and Distributed Computing
Print ISSN
0743-7315
Electronic ISSN
1096-0848
Publisher
Academic Press
Volume
16
Issue
4
Pages
292 - 305
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Series
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. 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.

Course
Other identifiers
Book Title
Keywords
Algorithms, Optimization, Hypercube, Programs, Systems
Citation
Published Version (Please cite this version)