Parallel computation for evaluating general linear recurrence equations Conference Paper uri icon

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.

published proceedings

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

author list (cited authors)

  • Lu, M., & Qiao, X.

complete list of authors

  • Lu, M||Qiao, X

publication date

  • December 1991