Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
An E cient Mapping Heuristic for Mesh-Connected Parallel Architectures Based
 

Summary: An E cient Mapping Heuristic for
Mesh-Connected Parallel Architectures Based
on Mean Field Annealing
_Ismail Haritaoglu and Cevdet Aykanat
Dept.of Comp. Eng. & Info. Scn., Bilkent University, Ankara, TURKEY
hismail@bilkent.edu.tr
Parallel Processing: CONPAR 94 - VAPP VI
B. Buchberger, J. Volkert (Eds.)
Abstract. A new Mean Field Annealing (MFA) formulation is proposed
forthe mapping problem for mesh-connected architectures. The proposed
MFA heuristic exploits the conventional routing scheme used in mesh in-
terconnection topologies to introduce an e cient encoding scheme. An
e cient implementation scheme which decreases the complexity of the
proposed algorithm by asymptotical factors is also developed. Experi-
mental results also show that the proposed MFA heuristic approaches the
speed performance of the fast Kernighan-Lin heuristic while approaching
the solution quality of the powerful simulated annealing heuristic.
1 Introduction
The mapping problem arises as parallel programs are developed for distributed
memory architectures. Various classes of problems can be decomposed into a set

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences