Reasoning about systolic algorithms
Journal Article
·
· J. Parallel Distrib. Comput.; (United States)
The authors present a methodology for verifying correctness of systolic algorithms. The methodology is based on solving a set of Uniform Recurrence Equations obtained from a description of systolic algorithms as a set of recursive equations. They present an approach to mechanically verify correctness of systolic algorithms, using the Boyer-Moore theorem proven. A mechanical correctness proof of an example from the literature is also presented.
- Research Organization:
- Pennsylvania State Univ., University Park, PA (USA). Dept. of Computer Science; AT and T Bell Labs., Holmdel, NJ (USA)
- OSTI ID:
- 5909320
- Journal Information:
- J. Parallel Distrib. Comput.; (United States), Journal Name: J. Parallel Distrib. Comput.; (United States) Vol. 5:6; ISSN JPDCE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reasoning about systolic algorithms
Systolic systems: algorithms and complexity
Recursive least squares filtering algorithms with systolic array architectures: a geometrical approach
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:5488823
Systolic systems: algorithms and complexity
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6471883
Recursive least squares filtering algorithms with systolic array architectures: a geometrical approach
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5868829