Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
IEEE Transactions on Computers
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Block-cyclic dense linear algebra
SIAM Journal on Scientific Computing
Embedding meshes on the star graph
Journal of Parallel and Distributed Computing
Unifying and Optimizing Parallel Linear Algebra Algorithms
IEEE Transactions on Parallel and Distributed Systems
A broadcasting algorithm in star graph interconnection networks
Information Processing Letters
Order preserving communication on a star network
Parallel Computing
A Well-Behaved Enumeration of Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel Computer Vision on a Reconfigurable Multiprocessor Network
IEEE Transactions on Parallel and Distributed Systems
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Selection, routing, and sorting on the star graph
Journal of Parallel and Distributed Computing
Matrix Decomposition on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
A Parallel Algorithm for Computing Fourier Transforms on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of product networks
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Perfect load balancing on the star interconnection network
The Journal of Supercomputing
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
| Hi-index | 0.00 |
In this paper, three new node-ranking schemes for the star graph are presented and evaluated. These node-ranking schemes efficiently "embed" grids, pipelines, and reconfigurable multiple ring networks (cases of torus networks). These schemes improve similar known results on the star graph. They also allow efficient mapping of a wide class of algorithms into the star graph and hence facilitating further testing for the viability of the star graph as a potential interconnection network for large-scale multiprocessor systems. The proposed node-ranking schemes outperform their hypercube counterparts in terms of communication cost. Finally, two algorithms for solving systems of linear equations are given. These algorithms are based on the proposed grid and pipeline schemes to carry out matrix triangulation and backward substitution, respectively.