Systolic Algorithms

Kung, H. T.

doi:10.1016/b978-0-12-546080-4.50009-1

Search citation statements

Order By: Relevance

Paper Sections

Select...

Motivation For Partitioning Algorithm1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1984

1989

Publication Types

Select...

Other2

Book1

Article1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, in many cases of practical interest, we are presented with nest of loops representing a recursion equation with some form of adjacency list. While the topic of parallelizing and partitioning systems of uniform recurrence equations has been well studied, see for instance [7], [5] this work all assumes that global knowledge of the dependency structure of a problem. An example of this kind of flexible data structure is given by figure 1 this figure depicts a Fortran code segment that could carry out the same computations as specified in equation 1 (subject to some appropriate set of boundary conditions).…”

Section: Motivation For Partitioning Algorithmmentioning

confidence: 99%

Runtime Aggregation of Recursion Relations

Berryman¹,

Salz²

1989

View full text Add to dashboard Cite

In many modern algorithms, relatively regular problems are encoded using flexible general purpose data structures. To obtain satisfactory performance on distributed memory architectures, it is often necessary to reconstruct and exploit the underlying dependency structure. Wel 'r' present a method to partition loops that have runtime dependencies that resemble uniform recurrence equations. Loops of this type are often found, among other places, in solving sparse triangular linear systems used for preconditioning in Krylov space iterative linear system solvers.

show abstract

Section: Motivation For Partitioning Algorithmmentioning

confidence: 99%