DocumentCode
2818871
Title
Parallel recursive algorithm for tridiagonal systems
Author
Huang, Yuguang
Author_Institution
Comput. Lab., Oxford Univ., UK
fYear
1997
fDate
19-21 Mar 1997
Firstpage
124
Lastpage
130
Abstract
In this paper, a parallel algorithm for solving tridiagonal equations based on recurrence is presented. Compared with the parallel prefix method (PP) which is also based on the recursive method, the computation cost is reduced by a factor of two while maintaining the same communication cost. The method can be viewed as a modified prefix method or prefix with substructuring. The complexity of the algorithm is analysed using the BSP model (Bulk Synchronous Parallel). Experimental results are obtained on a Sun workstation using the Oxford BSP Library
Keywords
matrix algebra; parallel algorithms; recursive functions; Oxford BSP Library; Sun workstation; communication cost; complexity; computation cost; modified prefix method; parallel algorithm; recursive algorithm; tridiagonal equations; tridiagonal systems; Costs; Difference equations; Global communication; Laboratories; Libraries; Parallel algorithms; Parallel machines; Parallel processing; Sun; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Advances in Parallel and Distributed Computing, 1997. Proceedings
Conference_Location
Shanghai
Print_ISBN
0-8186-7876-3
Type
conf
DOI
10.1109/APDC.1997.574022
Filename
574022
Link To Document