2010 Ninth International Symposium on Parallel and Distributed Computing 2010
DOI: 10.1109/ispdc.2010.11
|View full text |Cite
|
Sign up to set email alerts
|

Butterfly Automorphisms and Edge Faults

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…In addition, this new model allows one to exploit the powerful results in finite fields that have been developed over a century. A similar algebraic model for Wrapped Butterflies has previously allowed highly efficient mappings of cycles and trees [2] as well as investigations into automorphisms and fault avoidance [13,14]. The new models proposed here can be used to obtain similar results in case of the Cube Connected Cycles networks.…”
Section: Discussionmentioning
confidence: 83%
See 1 more Smart Citation
“…In addition, this new model allows one to exploit the powerful results in finite fields that have been developed over a century. A similar algebraic model for Wrapped Butterflies has previously allowed highly efficient mappings of cycles and trees [2] as well as investigations into automorphisms and fault avoidance [13,14]. The new models proposed here can be used to obtain similar results in case of the Cube Connected Cycles networks.…”
Section: Discussionmentioning
confidence: 83%
“…With these new models, one can avail of powerful algebraic techniques to investigate the structure and mappings of these networks. Similar algebraic models developed previously for the deBruijn network [12] and the Wrapped Butterflies [2] have allowed efficient mappings of cycles and trees on the Butterflies and provided insights into intricate structural properties such as the automorphisms [13,14]. The new models proposed here help solve similar problems in CCC n .…”
Section: Introductionmentioning
confidence: 73%