DocumentCode :
1832054
Title :
Parallel extended GCD algorithm
Author :
Wu, Pou-Yah ; Chen, Julian Chuen-Liang
Author_Institution :
Dept. of Inf. Manage., Kaohsiung Polytech. Inst., China
fYear :
1994
fDate :
26-29 Apr 1994
Firstpage :
357
Lastpage :
361
Abstract :
The extended GCD algorithm is very useful for data dependence tests, for example, the Power Test on supercomputers. We parallelize the extended GCD algorithm on a CREW SM MIMD computer with O(n) processors. We improve the sequential extended GCD algorithm and parallelize the extended GCD algorithm by two methods. We parallelize to triangularize the matrix by reducing elements in the same column simultaneously. This algorithm almost has no algorithmic redundancy, but has efficiency O(1/log2n) where n is the number of variables. Second, some rows, which have been reduced at the current column in the above algorithm, can be reduced at the next column immediately. This algorithm has efficiency O(min(m, n-1)/n) where m is the number of linear diophantine equations, and is powerful when m is large. When m is equal to n-1, the efficiency of the algorithm is O(1)
Keywords :
computational complexity; matrix algebra; parallel algorithms; parallel machines; CREW SM MIMD computer; Power Test; algorithmic redundancy; data dependence tests; efficiency; linear diophantine equations; matrix; parallel Guassian elimination; parallel extended GCD algorithm; sequential extended GCD algorithm; supercomputers; triangularize; Concurrent computing; Equations; Information management; Multidimensional systems; Parallel algorithms; Pipeline processing; Samarium; Supercomputers; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1994. Proceedings., Eighth International
Conference_Location :
Cancun
Print_ISBN :
0-8186-5602-6
Type :
conf
DOI :
10.1109/IPPS.1994.288277
Filename :
288277
Link To Document :
بازگشت