| dc.contributor.author | Bultan, T. | en_US |
| dc.contributor.author | Aykanat, C. | en_US |
| dc.date.accessioned | 2015-07-28T11:57:05Z | |
| dc.date.available | 2015-07-28T11:57:05Z | |
| dc.date.issued | 1992 | en_US |
| dc.identifier.issn | 0743-7315 | |
| dc.identifier.uri | http://hdl.handle.net/11693/11202 | |
| dc.description.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. | en_US |
| dc.language.iso | English | en_US |
| dc.source.title | Journal of Parallel and Distributed Computing | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/0743-7315(92)90013-D | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Optimization | en_US |
| dc.subject | Hypercube | en_US |
| dc.subject | Programs | en_US |
| dc.subject | Systems | en_US |
| dc.title | A new mapping heuristic based on mean field annealing | en_US |
| dc.type | Article | en_US |
| dc.department | Department of Computer Engineering | en_US |
| dc.citation.spage | 292 | en_US |
| dc.citation.epage | 305 | en_US |
| dc.citation.volumeNumber | 16 | en_US |
| dc.citation.issueNumber | 4 | en_US |
| dc.identifier.doi | 10.1016/0743-7315(92)90013-D | en_US |
| dc.publisher | Academic Press | en_US |
| dc.identifier.eissn | 1096-0848 | |
