×

RCC-FULL

swMATH ID: 2955
Software Authors: Vyas, A.; Maloo, R.; Gupta, P.
Description: Cost-optimal Gaussian elimination algorithm on RCC-FULL. This paper presents a cost-optimal parallel algorithm to find the solution of n simultaneous linear equations on RCC-FULL λ(N,L) network. The algorithm is designed following the strategy of the sequential Gaussian elimination algorithm. The algorithm utilizes strength of the RCC-FULL network which helps to reduce the time complexity and has the time complexity of O(n) with O(n 2 ) processors.
Homepage: http://www.tandfonline.com/doi/abs/10.1080/10637190310001633646
Keywords: RCC-FULL; Gaussian elimination; network; parallel algorithms; complexity
Related Software:
Referenced in: 2 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
Cost-optimal Gaussian elimination algorithm on RCC-FULL. Zbl 1054.65027
Vyas, A.; Maloo, R.; Gupta, P.
2003

Referenced by 2 Authors

1 Maloo, R.
1 Wu, Jie

Referencing Publications by Year