A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations.

摘要

An mth order recurrence problem is defined as the computation of the series x(1), z(2), ... x(N),where x(i) =fi(x(i-1),...x(i-m)) for some function f(i). This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Illiac 4. (Author)