1989
DOI: 10.1109/12.35837
|View full text |Cite
|
Sign up to set email alerts
|

Bisectional fault-tolerant communication architecture for supercomputer systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
9
0

Year Published

1991
1991
2004
2004

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(10 citation statements)
references
References 21 publications
1
9
0
Order By: Relevance
“…We show that distance-transitivity is a highly desirable property since these graphs are shown to be node-symmetric which helps in designing parallel and distributed systems with semi-distributed control. We focus on a class of DT graphs which are governed by two algebraic structures known as the Hamming [22] and the Johnson Association Schemes [24]. The graphs belonging to these schemes include the Hamming graph (the hyper-cube) and its derivative and the Sphere (Johnson) graph.…”
Section: Network Topologies For Large Systems and Their Algebraic Chamentioning
confidence: 99%
See 1 more Smart Citation
“…We show that distance-transitivity is a highly desirable property since these graphs are shown to be node-symmetric which helps in designing parallel and distributed systems with semi-distributed control. We focus on a class of DT graphs which are governed by two algebraic structures known as the Hamming [22] and the Johnson Association Schemes [24]. The graphs belonging to these schemes include the Hamming graph (the hyper-cube) and its derivative and the Sphere (Johnson) graph.…”
Section: Network Topologies For Large Systems and Their Algebraic Chamentioning
confidence: 99%
“…Anodexin aBisectional network is connected to a neighboryifHx, = n -1 [22]. We will denote a Bisectional network as Bn.…”
Section: 2mentioning
confidence: 99%
“…[Ho92] has shown that bisectional interconnection network of 2 n nodes for any even n, is isomorphic to the FHC(n). However, the FHC was chosen over the Bisectional Interconnection Network (BIN) [GhB89] because, as discussed in Section 3.2.2, FHC has simpler routing algorithm than that of the BIN and the BIN is valid only for odd degree -only switch sizes of 4, 16, 64, 256, etc. can be implemented with the BIN.…”
Section: New Atm Switches Based On the Folded Hypercubementioning
confidence: 99%
“…The bisectional interconnection network (BIN) proposed by [GhB89] is based on a class of codes, called binary even-weight codes. The topology is defined in terms of a parameter d, which will represent the degree of the network and will be considered to be odd.…”
Section: The Folded Hypercube and Bisectional Interconnection Networkmentioning
confidence: 99%
“…Three different topologies have been selected, including the ring (L = 2), the 16-node hypercube (L = 4) and the 16-node folded hypercube (L = 5) [7]. Points for one particular strategy are obtained for each topology by fixing one parameter and varying the rest.…”
Section: Simulation Environmentmentioning
confidence: 99%