Issue No. 09 - September (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.536939
<p><b>Abstract</b>—Midimew networks [<ref rid="bibl09544" type="bib">4</ref>] 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 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.</p>
Dilation, graph embedding, interconnection networks, mesh-connected computers, midimew networks, parallel processing, VLSI.
F. C. Lau and G. Chen, "Optimal Layouts of Midimew Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 954-961, 1996.