2005
DOI: 10.1016/j.jpdc.2005.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Swapped interconnection networks: Topological, performance, and robustness attributes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
43
1

Year Published

2007
2007
2008
2008

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 59 publications
(44 citation statements)
references
References 24 publications
0
43
1
Order By: Relevance
“…Note that the difference between this definition and that in [10] and [15] is that the case p = g is not excluded from the second set in the definition of E(Γ); in other words, here we postulate that the swap link associated with a node 〈p, p〉 in Sw(Ω) is a self-loop, whereas in the original definition of [10] and [15], node 〈p, p〉 lacks a swap link and thus has a node degree that is one less than that of node 〈p, g〉 with p ≠ g. The swapped network based on a regular n-node, degree-d network Ω has n 2 nodes of degree d + 1. Because the class of Cayley graphs exhibits many desirable properties and also includes a significant fraction of all networks that have been found useful in parallel processing, we next consider biswapped networks built from basis networks that are Cayley graphs.…”
Section: Relationship With Swapped Networkmentioning
confidence: 99%
See 2 more Smart Citations
“…Note that the difference between this definition and that in [10] and [15] is that the case p = g is not excluded from the second set in the definition of E(Γ); in other words, here we postulate that the swap link associated with a node 〈p, p〉 in Sw(Ω) is a self-loop, whereas in the original definition of [10] and [15], node 〈p, p〉 lacks a swap link and thus has a node degree that is one less than that of node 〈p, g〉 with p ≠ g. The swapped network based on a regular n-node, degree-d network Ω has n 2 nodes of degree d + 1. Because the class of Cayley graphs exhibits many desirable properties and also includes a significant fraction of all networks that have been found useful in parallel processing, we next consider biswapped networks built from basis networks that are Cayley graphs.…”
Section: Relationship With Swapped Networkmentioning
confidence: 99%
“…4. The 32-node biswapped network with the basis graph Ω = C 4 is homomorphic to the 16-node swapped network using the same basis graph, with the latter being identical to its counterpart in [10] if all the self-loops are removed.…”
Section: Relationship With Swapped Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…〈3,0〉 The following basis topological metrics of OTIS-Ω as functions of the corresponding metrics of Ω are derived from Definition 1 and similar expressions in [3,9]:…”
Section: 〈32〉mentioning
confidence: 99%
“…Although some studies are related to general properties, including fault tolerance, of OTIS networks [3,9,17,18], so far all research work in this direction is only confined to OTIS networks with basis networks being maximally fault tolerant, and those proposed constructions of parallel paths in these OTIS networks are closely dependent upon the corresponding constructions in their basis networks [2,3,9].…”
Section: Introductionmentioning
confidence: 99%