Parallel computation for evaluating general linear recurrence equations Conference Paper

abstract

• A block parallel partitioning method for evaluating the general m-th order linear recurrence equations is presented. The algorithm is based on a partitioning, in a way that ensures load balance during computation. The algorithm achieves a speedup of O(p) on a parallel computer with p-fold parallelism, which is linear and is greater than the existing results. The results were tested and evaluated on an MIMD machine, and were within 79% to 96% of the predicted performance for the 2-nd order linear recurrence problem.

authors

• Lu, Mi

published proceedings

• Conference Record - Asilomar Conference on Circuits, Systems & Computers

author list (cited authors)

• Lu, M. i., & Qiao, X.

citation count

• 0

complete list of authors

• Lu, Mi||Qiao, Xiangzhen

publication date

• December 1991

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Conference Record - Asilomar Conference on Circuits, Systems & Computers  Journal

start page

• 725

end page

• 729

volume

• 2

URL

• http://dx.doi.org/10.1109/acssc.1990.523434