Show simple item record

dc.contributor.authorBultan, T.en_US
dc.contributor.authorAykanat, C.en_US
dc.date.accessioned2015-07-28T11:57:05Z
dc.date.available2015-07-28T11:57:05Z
dc.date.issued1992en_US
dc.identifier.issn0743-7315
dc.identifier.urihttp://hdl.handle.net/11693/11202
dc.description.abstractA 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.isoEnglishen_US
dc.source.titleJournal of Parallel and Distributed Computingen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/0743-7315(92)90013-Den_US
dc.subjectAlgorithmsen_US
dc.subjectOptimizationen_US
dc.subjectHypercubeen_US
dc.subjectProgramsen_US
dc.subjectSystemsen_US
dc.titleA new mapping heuristic based on mean field annealingen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage292en_US
dc.citation.epage305en_US
dc.citation.volumeNumber16en_US
dc.citation.issueNumber4en_US
dc.identifier.doi10.1016/0743-7315(92)90013-Den_US
dc.publisherAcademic Pressen_US
dc.identifier.eissn1096-0848


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record