On the design of some systolic algorithms

Authors:
Jan L. A. van de Snepscheut;Johan B. Swenker
Affiliations:
Groningen Univ., The Netherlands;Groningen Univ., The Netherlands
Venue:
Journal of the ACM (JACM)
Year:
1989

Citing 5
Cited 3

Program construction and verification

Program construction and verification
A design methodology for synthesizing parallel algorithms and architectures

Journal of Parallel and Distributed Computing
The derivation of systolic implementations

Acta Informatica
The Science of Programming

The Science of Programming
A Discipline of Programming

A Discipline of Programming

Searching for Gapped Palindromes

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Searching for gapped palindromes

Theoretical Computer Science
Efficient retrieval of approximate palindromes in a run-length encoded string

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

The design of systolic algorithms is discussed, that is, algorithms that may efficiently be executed by a synchronous array of cells that perform local communications only. Systolic algorithms are designed through techniques developed in the context of sequential programming. Heuristics are given that guide the programmer in the design of a variety of efficient solutions.