Incomplete Star: An Incrementally Scalable Network Based on the Star Graph

Authors:
S. Latifi;N. Bagherzadeh
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 1
Cited 18

Incomplete Hypercubes

IEEE Transactions on Computers

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
A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks

IEEE Transactions on Parallel and Distributed Systems
Matrix Decomposition on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Recursive Cube of Rings: A New Topology for Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
Study of general incomplete star interconnection networks

Journal of Computer Science and Technology
A Routing and Broadcasting Scheme on Faulty Star Graphs

IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees

IEEE Transactions on Computers
Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach

IEEE Transactions on Parallel and Distributed Systems
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs for Larg-Scale Parallel Architecture

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Broadcasting on incomplete star graph interconnection networks

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
A faster algorithm for solving linear algebraic equations on the star graph

Journal of Parallel and Distributed Computing
Optimal broadcasting on incomplete star graph interconnection networks

Journal of Systems Architecture: the EUROMICRO Journal
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
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
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
Mstar: a new two level interconnection network

ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

Introduces a new interconnection network for massively parallel systems called theincomplete star graph. The authors describe unique ways of interconnecting and labelingthe nodes and routing point-to-point communications within this network. In addition,they provide an analysis of a special class of incomplete star graph called C/sup n/splminus/1/ graph and obtain the diameter and average distance for this network. For theC/sup n/spl minus/1/ graph, an efficient broadcasting scheme is presented. Furthermore,it is proven that a C/sup n/spl minus/1/ with N nodes (i.e. N=m(n/spl minus/1)!) isHamiltonian if m=4 or m=3k, and k/spl ne/2.