Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
The connection machine
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Fuzzy primary representations of fuzzy ideals
Information Sciences: an International Journal
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The tree machine: a highly concurrent computing environment
The tree machine: a highly concurrent computing environment
Graph Theory With Applications
Graph Theory With Applications
Task Allocation in the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Well-Behaved Enumeration of Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Balanced Spanning Trees in Complete and Incomplete Star Graphs
IEEE Transactions on Parallel and Distributed Systems
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal Polling in Communication Networks
IEEE Transactions on Parallel and Distributed Systems
Matrix Decomposition on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
Introduction to routing in multicomputer networks
ACM SIGARCH Computer Architecture News
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Study of general incomplete star interconnection networks
Journal of Computer Science and Technology
Building a Multicasting Tree in a High-Speed Network
IEEE Concurrency
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Embedding Star Networks into Hypercubes
IEEE Transactions on Computers
Transposition Networks as a Class of Fault-Tolerant Robust Networks
IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
Strong Fault-Tolerance: Parallel Routing in Networks with Faults
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Design and Analysis of Fault-Tolerant Star Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
Fault-Tolerant Ring Embedding in Star Graphs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Reliable Communication in Faulty Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Nearly Optimal One-To-Many Parallel Routing in Star Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
On Strong Menger-Connectivity of Star Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the topological properties of the arrangement-star network
Journal of Systems Architecture: the EUROMICRO Journal
Broadcasting on incomplete star graph interconnection networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
The shortest routing path in star graphs with faulty clusters
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
A faster algorithm for solving linear algebraic equations on the star graph
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
On strong Menger-connectivity of star graphs
Discrete Applied Mathematics
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Diagnosability of star graphs under the comparison diagnosis model
Information Processing Letters
Hierarchical star: a new two level interconnection network
Journal of Systems Architecture: the EUROMICRO Journal
Optimal broadcasting on incomplete star graph interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Routing direction determination in regular networks based on configurable circuits
Future Generation Computer Systems
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science
A Comparative Study of Star Graphs and Rotator Graphs
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Information Sciences: an International Journal
Substar Reliability Analysis in Star Networks
Information Sciences: an International Journal
An accurate mathematical performance model of adaptive routing in the star graph
Future Generation Computer Systems
OTIS-star an attractive alternative network
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Analytic performance comparison of hypercubes and star graphs with implementation constraints
Journal of Computer and System Sciences
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Global defensive alliances in star graphs
Discrete Applied Mathematics
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
The Journal of Supercomputing
Maximally Local Connectivity on Augmented Cubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Routing direction determination in regular networks based on configurable circuits
Future Generation Computer Systems
Diagnosability of star graphs under the comparison diagnosis model
Information Processing Letters
Mathematical performance modelling of stretched hypercubes
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Construction of vertex-disjoint paths in alternating group networks
The Journal of Supercomputing
A comparative performance analysis of n-cubes and star graphs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Analytical performance modelling of adaptive wormhole routing in the star interconnection network
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Cyclic vertex connectivity of star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Edge-bipancyclicity of star graphs with faulty elements
Theoretical Computer Science
Set-to-set disjoint-paths routing in recursive dual-net
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Enhanced-Star: a new topology based on the star graph
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
On randomized broadcasting in star graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
An efficient circuit–switched broadcasting in star graph
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
| Hi-index | 0.03 |
Undertakes a comparative study of two important interconnection network topologies:the star graph and the hypercube, from the graph theory point of view. Topologicalproperties are derived for the star graph and are compared with the correspondingproperties of the hypercube. Among other results, the authors determine necessary andsufficient conditions for shortest path routing and characterize maximum-sized families of parallel paths between any two nodes of the star graph. These parallel paths are provenof minimum length within a small additive constant. They also define greedy andasymptotically balanced spanning trees to support broadcasting and personalizedcommunication on the star graph. These results confirm the already claimed topologicalsuperiority of the star graph over the hypercube.