Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
In this paper, we are interested in solving the algebraic path problem (APP) on regular arrays. We first unify previous contributions with recurrence transformations. Then, we propose a new localization technique without long-range communication which leads to a piecewise affine scheduling of 4 n+ Θ...
Saved in:
Published in | Parallel computing Vol. 26; no. 11; pp. 1429 - 1445 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.10.2000
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper, we are interested in solving the algebraic path problem (APP) on regular arrays. We first unify previous contributions with recurrence transformations. Then, we propose a new localization technique without long-range communication which leads to a piecewise affine scheduling of 4
n+
Θ(1) steps, where
n is the size of the problem. The derivation of a locally connected space-time minimal solution with respect to the new scheduling constitutes the second contribution of the paper. This new design requires
n
2/3+
Θ(
n) elementary processors and solves the problem in 4
n+
Θ(1) steps, and this includes loading and unloading time. This is an improvement over the best previously known bounds. |
---|---|
ISSN: | 0167-8191 1872-7336 |
DOI: | 10.1016/S0167-8191(00)00039-9 |