A NEW MAPPING HEURISTIC BASED ON MEAN FIELD ANNEALING

被引：33

作者：

BULTAN, T

AYKANAT, C

机构：

[1] Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1992年 / 16卷 / 04期

关键词：

D O I：

10.1016/0743-7315(92)90013-D

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A new mapping heuristic is developed, based on the recently proposed Mean Field Annealing (MFA) algorithm. An efficient 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 well-known 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. The inherent parallelism of the MFA is exploited by designing an efficient parallel algorithm for the proposed MFA heuristic. © 1992.

引用

页码：292 / 305

页数：14

共 25 条

[1] HEURISTIC ALGORITHMS FOR PROCESS ASSIGNMENT IN DISTRIBUTED COMPUTING SYSTEMS [J].