Gaussian elimination on hypercubes
Proceedings of the international workshop on Parallel algorithms & architectures
Gaussian elimination on a hypercube automaton
Journal of Parallel and Distributed Computing
On the parallelization of blocked LU factorization algorithms on distributed memory architectures
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
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
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
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
Design and Evaluation of Parallel Block Algorithms: LU Factorization on an IBM 3090 VF/600J
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing
On the Performance of Parallel Matrix Factorisation on the Hypermesh
The Journal of Supercomputing
Reliable Communication in Faulty Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On the topological properties of the arrangement-star network
Journal of Systems Architecture: the EUROMICRO Journal
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
Analytic performance comparison of hypercubes and star graphs with implementation constraints
Journal of Computer and System Sciences
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
Structural Outlooks for the OTIS-Arrangement Network
International Journal of Grid and High Performance Computing
| Hi-index | 0.00 |
We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N3/n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N驴 (n驴 1)!. The incurred communication time is better than the best known results for the hypercube, O(N log n!), and the mesh, $O(N\sqrt {n!}),$ each with approximately n! nodes. The proposed parallel algorithm takes advantage of the attractive topological qualities of the star graph in order to reduce the communication time involved in tasks such as pivoting, row/column interchanges, and pivot row and multipliers column broadcasts.