RCC-FULL

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

Anything in here will be replaced on browsers that support the canvas element


References in zbMATH (referenced in 3 articles , 1 standard article )

Showing results 1 to 3 of 3.
Sorted by year (citations)

  1. Vyas, A.; Maloo, R.; Gupta, P.: Cost-optimal Gaussian elimination algorithm on RCC-FULL (2003)
  2. Zheng, S. Q.; Wu, Jie: Dual of a complete graph as an interconnection network (2000)
  3. Hamdi, Mounir; Hall, Richard W.: RCC-full: An effective network for parallel computations. (1997) ioport