A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Embedding meshes on the star graph
Journal of Parallel and Distributed Computing
A broadcasting algorithm in star graph interconnection networks
Information Processing Letters
Embedding an Arbitrary Binary Tree into the Star Graph
IEEE Transactions on Computers
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
Embeddings of star graphs into optical meshes without bends
Journal of Parallel and Distributed Computing
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Embedding Star Networks into Hypercubes
IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
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
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
International Journal of Computer Mathematics
| Hi-index | 0.00 |
The problem of solving a linear system of equations is widely encountered in many fields of science and engineering. In this paper, we present a parallel algorithm to solve the above problem on a star graph. The proposed solution (i) is based on a variant of the Gaussian elimination algorithm (GE) called the successive Gaussian elimination algorithm (SGE) (IEE ProC. Comput. Digit. Tech. 143 (4) (1996)) and (ii) supports partial pivoting to provide numerical stability. We present efficient matrix distribution techniques on the star graph. Our proposed parallel algorithm employs these techniques to reduce communication overhead during matrix operations on the star graph. We estimate the performance of our parallel algorithm and demonstrate its effectiveness by comparing it with a recent algorithm for the same problem on star graphs (IEEE Trans. Parallel Distrib. Systems 8 (8) (1997) 803).