This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Mapping Problem
March 1981 (vol. 30 no. 3)
pp. 207-214
S.H. Bokhari, Department of Electrical Engineering, University of Engineering and Technology
In array processors it is important to map problem modules onto processors such that modules that communicate with each other lie, as far as possible, on adjacent processors. This mapping problem is formulated in graph theoretic terms and shown to be equivalent, in its most general form, to the graph isomorphism problem. The problem is also very similar to the bandwidth reduction problem for sparse matrices and to the quadratic assignment problem.
Index Terms:
pairwise interchange, Adjacency matrices, array processing, assignment, computer networks, distributed processors, finite element machine, graph isomorphism, heuristic algorithm, mapping problem
Citation:
S.H. Bokhari, "On the Mapping Problem," IEEE Transactions on Computers, vol. 30, no. 3, pp. 207-214, March 1981, doi:10.1109/TC.1981.1675756
Usage of this product signifies your acceptance of the Terms of Use.