Optimal layouts of midimew networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 9, 1996, Pages 954-961

  Lau, Francis C M ^a,b   Chen, Guihai ^b  

^a IEEE

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Dilation; Graph embedding; Interconnection networks; Mesh connected computers; Midimew networks; Parallel processing; VLSI

Indexed keywords

COMPUTER CIRCUITS; GRAPH THEORY; OPTIMAL SYSTEMS; PARALLEL PROCESSING SYSTEMS; VLSI CIRCUITS;

DILATION; GRAPH EMBEDDING; MESH CONNECTED COMPUTERS; MIDIMEW NETWORKS;

INTERCONNECTION NETWORKS;

EID: 0030244655     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.536939     Document Type: Article

References (21)

1. A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
2. B.W. Arden and K.W. Tang, "Representations and Routing for Cayley Graphs, "IEEE Trans. Comm., vol. 39, no. 11, pp. 1,533-1,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. 42-51, 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,109-1,124, Oct. 1991.
5. F.T. Boesch and R. Tindell, "Circulants and Their Connectivities," J. Graph Theory, vol. 8, pp. 487-499, 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. 353-358, Mar. 1993.
7. L. Campbell et al., "Small Diameter Symmetric Networks from Linear Groups," IEEE Trans. Computers, vol. 41, no. pp. 2, 218-220, Feb. 1992.
8. W.J. Dally, "Wire Efficient VLSI Multiprocessor Communication Networks," Proc. Stanford Conf. Advanced Research in VLSI, pp. 391-415, 1987.
9. W.J. Dally, "Performance Analysis of k-ary n-cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1990.
10. Y. Feldman and E. Shapiro, "Spatial Machines: A More Realistic Approach to Parallel Computation," CACM, vol. 35, no. 10, pp. 61-73, Oct. 1992.
11. G.A. Gessesse and S. Chalasani, "New Degree Four Networks: Properties and Performance," Proc. Seventh Int'l Parallel Processing Symp., pp. 168-172, Apr. 1993.
12. V. Hatz, "Interconnection Networks Based on Block Designs," Proc. CONPAR 92-VAPP V, pp. 37-42, Sept. 1992.
13. W.D. Hillis, The Connection Machine. MIT Press, 1985.
14. L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, pp. 62-76, 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. 293-299, 1981.
16. G. Ramanathan and J. Oren, "Survey of Commercial Parallel Machines," ACM Computer Architecture News, vol. 21, no. 3, pp. 13-33, 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. 479-482, 1987.
18. C.H. Sequin, "Doubly Twisted Torus Networks for VLSI Processor Arrays," Proc. Eighth Ann. Symp. Computer Architecture, pp. 471-480, 1981.
19. C.D. Thompson, "Area-Time Complexity for VLSI," Proc. 11th Ann. Symp. Theory of Computing, pp. 81-88, 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. 659-672, Aug. 1988.