Issue No. 11 - November (2000 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.888634
<p><b>Abstract</b>—In this paper, we present an incremental design of scalable interconnection networks in multicomputer systems using basic building blocks. Both network topologies and routing algorithms are considered. We use wormhole-routed small-scale 2D meshes as basic building blocks. The minimum requirement to expand these networks is a single building block. This implies that the network does not have to maintain the regular 2D mesh topology. Some new topologies are introduced: incomplete meshes based on those adaptive routing algorithms designed from the turn model and extended incomplete meshes based on XY routing. We show that the original routing algorithm can be adopted to send a message between any source and destination without using store-and-forward and causing deadlock. The way that the network is constructed incrementally requires no or a very small amount of rewiring and keeps high bisection density and short diameter of the network. The design methods can be used to economically and incrementally build expandable and scalable parallel computers.</p>
Scalable interconnection networks, scalable parallel computers, wormhole routing, incremental design, mesh networks, adaptive routing.
L. M. Ni and M. Yang, "Incremental Design of Scalable Interconnection Networks Using Basic Building Blocks," in IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 1126-1140, 2000.