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.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Vyas, A.; Maloo, R.; Gupta, P.: Cost-optimal Gaussian elimination algorithm on RCC-FULL (2003)
- Zheng, S.Q.; Wu, Jie: Dual of a complete graph as an interconnection network (2000)