Laying out midimew networks with constant dilation

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 854)


Midimew networks [1] are mesh-connected networks derived from a subset of degree-4 circulant graphs. They have minimum diameter and average distance among all degree-4 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 2-D plane, long cross wires that grow with the size of the network appear. In this paper, we propose ways to embed rectangular midimew networks in a 2-D grid so that the length of the longest wire is at most a small constant.


graph embedding interconnection networks mesh-connected computers midimew networks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Beivide, E. Herrada, J.L. Balcázar, and A. Arruabarrena, “Optimal Distance Networks of Low Degree for Parallel Computers”, IEEE Trans. on Computers, Vol. 40, No. 10, October 1991, 1109–1124.Google Scholar
  2. 2.
    F.T. Boesch and R. Tindell, “Circulants and Their Connectivities”, J. of Graph Theory, Vol. 8, 1984, 487–499.Google Scholar
  3. 3.
    H. Braun and F.C. Stephan, “On Optimizing Diameter and Average Distance of Directed Interconnected Networks”, IEEE Trans. on Computers, Vol. 42, No. 3, March 1993, 353–358.Google Scholar
  4. 4.
    L. Campbell et al., “Small Diameter Symmetric Networks from Linear Groups”, IEEE Trans. on Computers, Vol. 41, No. 2, February 1992, 218–220.Google Scholar
  5. 5.
    F.C.M. Lau and G. Chen, Optimal Layouts of Midimew Networks, Technical Report TR-94-03, Department of Computer Science, The University of Hong Kong, 1994.Google Scholar
  6. 6.
    W.J. Dally, “Wire efficient VLSI Multiprocessor Communication Networks”, Proceedings of Stanford Conference on Advanced Research in VLSI, 1987, 391–415.Google Scholar
  7. 7.
    W.J. Dally, “Performance Analysis of κ-ary n-cube Interconnection Networks”, IEEE Trans. on Computers, Vol. 39, No. 6, June 1990, 775–785.Google Scholar
  8. 8.
    G.A. Gessesse and S. Chalasani, “New Degree Four Networks: Properties and Performance”, Proceedings of 7th International Parallel Processing Symposium, April 1993, 168–172.Google Scholar
  9. 9.
    K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability, McGraw-Hill, 1993.Google Scholar
  10. 10.
    F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, 1992.Google Scholar
  11. 11.
    L.M. Ni and P.K. McKinley, “A Survey of Wormhole Routing Techniques in Direct Networks”, IEEE Computer, Vol. 26, February 1993, 62–76.Google Scholar
  12. 12.
    M.S. Paterson, W.L. Ruzzo, and L. Snyder, “Bounds on Minimax Edge Length for Complete Binary Trees”, Proceedings of 13th ACM Symposium on Theory of Computing, 1981, 293–299.Google Scholar
  13. 13.
    G. Ramanathan and J. Oren, “Survey of Commercial Parallel Machines”, ACM Computer Architecture News, Vol. 21, No. 3, June 1993, 13–33.Google Scholar
  14. 14.
    A.G. Ranade and S.L. Johnsson, “The Communication Efficiency of Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integration”, Proceedings of 1987 International Conference on Parallel Processing, 1987, 479–482.Google Scholar
  15. 15.
    A. Varma and C.S. Raghavendra, Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice, IEEE Computer Society Press, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  1. 1.Department of Computer ScienceThe University of Hong KongHong Kong

Personalised recommendations