A parallel first-order linear recurrence solver
In this paper we present a parallel procedure for the solution of first-order linear recurrence systems of size N when the number of processors p is small in relation to N. We show that when 1 < p 2 ⩽ N, a first-order linear recurrence system of size N can be solved in 5 (N − 1) (p + 1) steps on...
Saved in:
| Published in | Journal of parallel and distributed computing Vol. 4; no. 2; pp. 117 - 132 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.04.1987
|
| Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!