| A. W c. Fu and S.-C. Chau. Cyclic-cubes: A new family of interconnection networks of even fixed-degrees. IEEE Transactions on Parallel and Distributed Systems, 9(12):253, December 1998. |
....the size of the network constrains feasible VLSI implementation of large networks. A number of VLSI realizable architectures such as Cube Connected Cycles, Cyclic Cubes, Fat Trees, Hypertrees, Shu e Exchange(SE) Hypernets, Star(Cayley Graphs) Peterson s Graphs, Pyramids, Mesh of Trees (MOT) [9, 11, 13, 20, 28, 33], among many others, have been proposed as alternates to the HC, and their competitiveness is often ascertained in terms of the graph embeddings supported by them. The binary deBruijn graph(BDG) rst proposed as a VLSI interconnection network in [26] has been shown [2, 7, 29, 32] to be a viable ....
....of practical use, and (b) the inter embedding support inside the HD is actually more complex and restricted than in either the HC or BDG. Other comparative attributes of the HD are detailed in Tables I and II. Similarly, a variety of other interconnects and emulation approaches exist in literature [11, 24, 30, 31, 36] among others which aim at providing versatile, ecient and realizable networks that support a wide range of embeddings. The purpose behind this discussion is to highlight that the strengths of an interconnect are conventionally assessed by either (a) a demonstration of direct graph embeddings ....
A. Fu and S. Chau, \Cyclic Cubes: A New Family of Interconnection Networks of Even Fixed Degree," IEEE Trans. on Parallel and Dist. Systems, vol. 9, #12, pp. 1253-1268, Dec. 1998.
No context found.
A. W c. Fu and S.-C. Chau. Cyclic-cubes: A new family of interconnection networks of even fixed-degrees. IEEE Transactions on Parallel and Distributed Systems, 9(12):253, December 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC