The connection machine
Locality, communication, and interconnect length in multicomputers
SIAM Journal on Computing
Processor networks and interconnection networks without long wires
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Optimal Distance Networks of Low Degree for Parallel Computers
IEEE Transactions on Computers
Small Diameter Symmetric Networks From Linear Groups
IEEE Transactions on Computers
Spatial machines: a more realistic approach to parallel computation
Communications of the ACM
Survey of commercial parallel machines
ACM SIGARCH Computer Architecture News
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
On Optimizing Diameter and Average Distance of Directed Interconnected Networks
IEEE Transactions on Computers
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks Based on Block Designs
CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
Doubly twisted torus networks for VLSI processor arrays
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Bounds on minimax edge length for complete binary trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Tighter Layouts of the Cube-Connected Cycles
IEEE Transactions on Parallel and Distributed Systems
Improving parallel system performance by changing the arrangement of the network links
Proceedings of the 14th international conference on Supercomputing
Dense bipartite circulants and their routing via rectangular twisted torus
Discrete Applied Mathematics
| Hi-index | 0.00 |
Midimew networks [4] 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.