1. The fastcube: a variation on hypercube topology with lower diameter
- Author
-
Ghozati, S.A. and Smires, T.
- Subjects
Algebraic topology -- Methods ,Topology ,Processor architecture -- Design and construction ,Finite element method -- Usage ,Processor architecture ,Computers ,Electronics ,Engineering and manufacturing industries - Abstract
This paper presents a class of n-dimensional interconnection topologies with N = [2.sup.n] nodes which we refer to as n-fastcubes. The node degree of the n-fastcube is n and its diameter is [(n + 1)/2], which is substantially smaller than that of the same size hypercube. Topological properties as well as several routing algorithms for fastcubes are developed. In addition, a new methodology for the design and analysis of fastcubes is employed. This methodology is based on modeling interconnection networks as finite state automata. The inputs to these particular automata are routing sequences. The routing and embedding algorithms developed in this paper produce routing sequences. The main characteristic of routing sequences is their node independence. A node independent routing sequence, p(H), produces a path between any pair of nodes with the Hamming distance of H. Thus, these sequences can be used, without modification, at any node to establish paths in a fastcube. Keywords: Interconnection networks; Hypercube; Topology design; Routing
- Published
- 2003