An improved recursive doubling algorithm for solving linear recurrence R <n,1>is given,whose parallel time complexity is (τ++τ.) logn when n processors are available,achieving the lower bound in array processo...An improved recursive doubling algorithm for solving linear recurrence R <n,1>is given,whose parallel time complexity is (τ++τ.) logn when n processors are available,achieving the lower bound in array processor type computation.展开更多
文摘An improved recursive doubling algorithm for solving linear recurrence R <n,1>is given,whose parallel time complexity is (τ++τ.) logn when n processors are available,achieving the lower bound in array processor type computation.
