A comparative performance analysis of n-cubes and star graphs

Kiasari,; Sarbazi-Azad,

doi:10.1109/ipdps.2006.1639643

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2007

2009

Publication Types

Select...

Other2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[1,2,16,18,28,31]. The star network can connect more processors with less interconnections and less communication delay than the popular hypercube [9,17]. More specifically, growth in the node degree and diameter is sub-logarithmic to the network size in the star network, but logarithmic in the hypercube.…”

Section: Introductionmentioning

confidence: 99%

Substar Reliability Analysis in Star Networks

Latifi

2008

Information Sciences

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Substar Reliability Analysis in Star Networks

Latifi

2008

Information Sciences

View full text Add to dashboard Cite

“…Because of high similarity between hypercube and star network [5] [7], star network is highly robust. It has been proved that the connectivity among nodes in this topology can be preserved despite a substantial number of failures (in terms of node, link or node/link failures).…”

Section: Introductionmentioning

confidence: 99%