Issue No. 03 - March (2000 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.841743
<p><b>Abstract</b>—In this paper, we introduce a family of scalable interconnection network topologies, named Recursive Cube of Rings (RCR), which are recursively constructed by adding ring edges to a cube. RCRs possess many desirable topological properties in building scalable parallel machines, such as fixed degree, small diameter, wide bisection width, symmetry, fault tolerance, etc. We first examine the topological properties of RCRs. We then present and analyze a general deadlock-free routing algorithm for RCRs. Using a complete binary tree embedded into an RCR with expansion-cost approximating to one, an efficient broadcast routing algorithm on RCRs is proposed. The upper bound of the number of message passing steps in one broadcast operation on a general RCR is also derived.</p>
Scalable computer systems, recursive cube of rings (RCR), plane property, embedding, message routing.
X. Lin, Y. Sun and P. Y. Cheung, "Recursive Cube of Rings: A New Topology for Interconnection Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 275-286, 2000.