Reasoning about systolic algorithms

Journal Article · Thu Dec 01 00:00:00 EST 1988 · J. Parallel Distrib. Comput.; (United States)

DOI:https://doi.org/10.1016/0743-7315(88)90036-6· OSTI ID:5909320

Purushothaman, S; Subrahmanyam, P A

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), Vol. 5:6
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
ALGORITHMS
EQUATIONS
THEORETICAL DATA
DATA
INFORMATION
MATHEMATICAL LOGIC
NUMERICAL DATA
PROGRAMMING
990210* - Supercomputers- (1987-1989)
990200 - Mathematics & Computers