This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Heuristic Technique for Processor and Link Assignment in Multicomputers
March 1991 (vol. 40 no. 3)
pp. 325-333

A graph-based solution to the mapping problem using the simulated annealing optimization heuristic is developed. An automated two-phase mapping strategy is formulated: process annealing assigns parallel processes to processing nodes, and connection annealing schedules traffic connections on network data links so that interprocess communication conflicts are minimized. To evaluate the quality of generated mappings. cost functions suitable for simulated annealing that accurately quantify communications overhead are derived. Communication efficiency is formulated to measure the quality of assignments when the optimal mapping is unknown. The mapping scheme is implemented using the hypercube as a host architecture, and results for several image graphs are presented.

[1] M. Hannan and J. M. Kurtzberg, "A review of the placement and quadratic assignment problems,"SIAM Rev., vol. 14, pp. 324-342, Apr. 1972.
[2] S. H. Bokhari, "On the mapping problem,"IEEE Trans. Comput., vol. C-30, pp. 207-214, Mar. 1981.
[3] R. P. Bianchini, Jr. and J. P. Shen, "Interprocessor traffic scheduling algorithm for multiple-processor networks,"IEEE Trans. Comput., vol. C-36, pp. 396-409, Apr. 1987.
[4] C. S. Steele, "Placement of communicating processes on multiprocessor networks," California Institute of Technology Comput. Sci. Dep., Tech. Rep. 5184:TR:85, Apr. 1985.
[5] S.-Y. Lee and J. K. Aggarwal, "A mapping strategy for parallel processing,"IEEE Trans. Comput., vol. C-36, pp. 433-442, Apr. 1987.
[6] S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing,"Science, vol. 220, pp. 671-680, May 1983.
[7] S. A. Kravitz and R. A. Rutenbar, "Multiprocessor-based placement by simulated annealing," inProc. 23rd Design Automat. Conf., June 1986, pp. 567-573.
[8] P. Siarry, L. Bergonzi, and G. Dreyfus, "Thermodynamic optimization of block placement,"IEEE Trans. Comput.-Aided Design, vol. CAD-6, pp. 211-221, Mar. 1987.
[9] J. S. Rose, D. R. Blythe, W. M. Snelgrove, and Z. G. Vranesic, "Fast, high quality VLSI placement on an MIMD multiprocessor," inProc. IEEE Int. Conf. Comput.-Aided Design, 1986, pp. 42-45.
[10] J. Lam and J-M. Delosme, "Logic minimization using simulated annealing," inProc. IEEE Int. Conf. Comput.-Aided Design, 1986, pp. 348-351.
[11] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.

Index Terms:
processor assignment; scheduling; communication efficiency; hypercube architecture; link assignment; multicomputers; mapping problem; simulated annealing optimization heuristic; automated two-phase mapping; process annealing; parallel processes; processing nodes; connection annealing; traffic connections; network data links; communication conflicts; cost functions; communications overhead; image graphs; graph theory; hypercube networks; simulated annealing.
Citation:
S.W. Bollinger, S.F. Midkiff, "Heuristic Technique for Processor and Link Assignment in Multicomputers," IEEE Transactions on Computers, vol. 40, no. 3, pp. 325-333, March 1991, doi:10.1109/12.76410
Usage of this product signifies your acceptance of the Terms of Use.