Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Highly parallel computing
A Well-Behaved Enumeration of Star Graphs
IEEE Transactions on Parallel and Distributed Systems
An Optimal Broadcasting Algorithm without Message Redundancy in 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
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Matrix Decomposition on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Fault Tolerant Algorithms for Broadcasting on the Star Graph Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Neighborhood Information Dissemination in the Star Graph
IEEE Transactions on Computers
Efficient communication algorithms for pipeline multicomputers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Study of general incomplete star interconnection networks
Journal of Computer Science and Technology
Building a Multicasting Tree in a High-Speed Network
IEEE Concurrency
IEEE Transactions on Computers
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
Fault-Tolerant Ring Embedding in Star Graphs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
One-to-All Broadcasting Scheme for Static Interconnection Networks with Arbitrary Topology
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
One-to-All Broadcasting Scheme for Hypercubes with Background Traffic
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Broadcasting on incomplete star graph interconnection networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Fault tolerance on star graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Communication algorithms on alternating group graphs
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
Broadcasting schemes for hypercubes with background traffic
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
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
Leader election in hierarchical star network
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
The Journal of Supercomputing
Scheduling for atomic broadcast operation in heterogeneous networks with one port model
The Journal of Supercomputing
Properties of a hierarchical network based on the star graph
Information Sciences: an International Journal
Edge-bipancyclicity of star graphs with faulty elements
Theoretical Computer Science
Fault tolerant routing in star graphs using fault vector
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
Hi-index | 0.03 |
The star graph has been show to be an attractive alternative to the widely used n-cube. Like the n-cube, the star graph possesses rich structure and symmetry as well as fault tolerant capabilities, but has a smaller diameter and degree. However, very few algorithms exists to show its potential as a multiprocessor interconnection network. Many fast and efficient parallel algorithms require broadcasting as a basic step. An optimal algorithm for one-to-all broadcasting in the star graph is proposed. The algorithm can broadcast a message to N processors in O(log/sub 2/ N) time. The algorithm exploits the rich structure of the star graph and works by recursively partitioning the original star graph into smaller star graphs. In addition, an optimal all-to-all broadcasting algorithm is developed.