Loading...
Please wait, while we are loading the content...
Similar Documents
An Efficient Mapping Heuristic for Mesh-Connected Parallel Architectures Based On Mean Field Annealing (1994)
| Content Provider | CiteSeerX |
|---|---|
| Author | Aykanat, Cevdet Haritaoglu, Ismail |
| Abstract | A new Mean Field Annealing (MFA) formulation is proposed for the mapping problem for mesh-connected architectures. The proposed MFA heuristic exploits the conventional routing scheme used in mesh interconnection topologies to introduce an e cient encoding scheme. An e cient implementation scheme which decreases the complexity ofthe proposed algorithm by asymptotical factors is also developed. Experimental results also show that the proposed MFA heuristic approaches the speed performance of the fast Kernighan-Lin heuristic while approaching the solution quality ofthepowerful simulated annealing heuristic. |
| File Format | |
| Publisher Date | 1994-01-01 |
| Access Restriction | Open |
| Subject Keyword | Complexity Ofthe Conventional Routing Scheme Mesh Interconnection Topology Asymptotical Factor Mean Field Annealing Mapping Problem Cient Implementation Scheme Speed Performance Efficient Mapping Heuristic Mesh-connected Parallel Architecture Mesh-connected Architecture Fast Kernighan-lin Heuristic New Mean Field Annealing Mfa Heuristic Approach |
| Content Type | Text |
