
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Francis C.M. Lau, Guihai Chen, "Optimal Layouts of Midimew Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 9, pp. 954961, September, 1996.  
BibTex  x  
@article{ 10.1109/71.536939, author = {Francis C.M. Lau and Guihai Chen}, title = {Optimal Layouts of Midimew Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {9}, issn = {10459219}, year = {1996}, pages = {954961}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.536939}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Optimal Layouts of Midimew Networks IS  9 SN  10459219 SP954 EP961 EPD  954961 A1  Francis C.M. Lau, A1  Guihai Chen, PY  1996 KW  Dilation KW  graph embedding KW  interconnection networks KW  meshconnected computers KW  midimew networks KW  parallel processing KW  VLSI. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Midimew networks [4] are meshconnected networks derived from a subset of degree4 circulant graphs. They have minimum diameter and average distance among all degree4 circulant graphs, and are better than some of the most common topologies for parallel computers in terms of various cost measures. Among the many midimew networks, the rectangular ones appear to be most suitable for practical implementation. Unfortunately, with the normal way of laying out these networks on a 2D plane, long cross wires that grow with the size of the network exist. In this paper, we propose ways to lay out rectangular midimew networks in a 2D grid so that the length of the longest wire is at most a small constant. We prove that these constants are optimal under the assumption that rows and columns are moved as a whole during the layout process.
[1] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398412, Oct. 1991.
[2] B.W. Arden and K.W. Tang,“Representation and routing of Cayley graphs,” IEEE Trans. Comm., vol. 39, no. 11, pp. 1,5331,537, Nov. 1991.
[3] R. Beigel and C.P. Kruskal, "Processor Networks and Interconnection Networks without Long Wires," Proc. First ACM Symp. Parallel Algorithms and Architectures, pp. 4251, 1989.
[4] R. Beivide, E. Herrada, J.L. Balcázar, and A. Arruabarrena, "Optimal Distance Networks of Low Degree for Parallel Computers," IEEE Trans. Computers, vol. 40, no. 10, pp. 1,1091,124, Oct. 1991.
[5] F.T. Boesch and R. Tindell, "Circulants and Their Connectivities," J. Graph Theory, vol. 8, pp. 487499, 1984.
[6] H. Braun and F.C. Stephan, "On Optimizing Diameter and Average Distance of Directed Interconnected Networks," IEEE Trans. Computers, vol. 42, no. 3, pp. 353358, Mar. 1993.
[7] L. Campbell et al., "Small Diameter Symmetric Networks from Linear Groups," IEEE Trans. Computers, vol. 41, no. pp. 2, 218220, Feb. 1992.
[8] W.J. Dally, "Wire Efficient VLSI Multiprocessor Communication Networks," Proc. Stanford Conf. Advanced Research in VLSI, pp. 391415, 1987.
[9] W.J. Dally, "Performance Analysis of kary nCube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775785, June 1992.
[10] Y. Feldman and E. Shapiro, "Spatial Machines: A More Realistic Approach to Parallel Computation," CACM, vol. 35, no. 10, pp. 6173, Oct. 1992.
[11] G.A. Gessesse and S. Chalasani, "New Degree Four Networks: Properties and Performance," Proc. Seventh Int'l Parallel Processing Symp., pp. 168172, Apr. 1993.
[12] V. Hatz, "Interconnection Networks Based on Block Designs," Proc. CONPAR 92VAPP V, pp. 3742, Sept. 1992.
[13] W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
[14] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[15] M.S. Paterson, W.L. Ruzzo, and L. Snyder, "Bounds on Minimax Edge Length for Complete Binary Trees," Proc. 13th ACM Symp. Theory of Computing, pp. 293299, 1981.
[16] G. Ramanathan and J. Oren, "Survey of Commercial Parallel Machines," ACM Computer Architecture News, vol. 21, no. 3, pp. 1333, June 1993.
[17] A.G. Ranade and S.L. Johnsson, "The Communication Efficiency of Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integration," Proc. 1987 Int'l Conf. Parallel Processing, pp. 479482, 1987.
[18] C.H. Sequin, "Doubly Twisted Torus Networks for VLSI Processor Arrays," Proc. Eighth Ann. Symp. Computer Architecture, pp. 471480, 1981.
[19] C.D. Thompson, "AreaTime Complexity for VLSI," Proc. 11th Ann. Symp. Theory of Computing, pp. 8188, 1979.
[20] A. Varma and C.S. Raghavendra, Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice. IEEE C. S. Press, 1994.
[21] P.M.B. Vitányi, "Locality, Communication, and Interconnect Length in Multicomputers," SIAM J. Computing, vol. 17, no. 4, pp. 659672, Aug. 1988.