Abstract
Several recent papers demonstrate the interest of viewing systolic algorithms as while-programs whose statements are synchronous multiple assignments. This approach is based on the classical invariant method and compares favourably with earlier ones, based on recurrence systems and space-time transformations. Our purpose is to use the particularities of the systolic paradigm to reduce the creativity needed to develop a systolic algorithm and its invariant. More precisely, two points are taken into account. First, the architecture is often chosen before the real beginning of the development and, second, the basic operations to be executed by individual cells are also partially known at the beginning. In fact, the development does not start from scratch, but from a “generic systolic array” (gsa), whose parameters have to be instantiated. Most systolic arrays are instances of a simple gsa that is introduced, investigated and illustrated in this paper.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Anaratone et al., “Warp architecture and implementation”, Proc. 13th Int. Syrnp. on Computer Architecture, pp. 346–356, 1986
K.M. Chandy, J. Misra, “Systolic algorithms as programs”, Distributed Computing 1, pp. 177–183 (1986)
K.M. Chandy, J. Misra, “Parallel Program Design: A Foundation”, Addison-Wesley, Reading, Mass, 1988
M.C. Chen, “Synthesizing VLSI architectures: Dynamic programming solver”, Proc. of the 1986 Int. Conf. on Parallel Processing, pp. 776–784, 1986
E.W. Dijkstra, “A discipline of programming”, Prentice-Hall, New-Jersey, 1976
J.A.B. Fortes et al., “Systematic approaches to the design of algorithmically specified systolic arrays”, IEEE Conf. ICASSP 85, vol. 1, pp. 300–302, 1985
P. Gribomont, “Proving systolic arrays”, L.N.C.S. 299, pp. 185–199 (1988)
M. Hennessy, “Proving Systolic Systems Correct”, ACM Toplas 8, pp. 344–387 (1986)
C.H. Huang, C. Lengauer, “An implemented method for incremental systolic design”, L.N.C.S. 258, pp. 160–177 (1987)
R.M. Karp, R.E. Miller, S. Winograd, “The organization of computations for uniform recurrence equations”, J.ACM 14, pp. 563–590 (1967)
D.E. Knuth, “The art of computer programming”, vol. 1, Addison-Wesley, Reading, Mass, 1968
H.T. Kung, C.E. Leiserson, “Algorithms for VLSI processor arrays”, in “Introduction to VLSI systems”, Mead and Conway (Eds), Addison-Wesley, Reading, Mass, pp. 271–292, 1980
A.R. Martin, J.V. Tucker, “The concurrent assignment representation of synchronous systems”, Parallel Computing 9, pp. 227–256 (1989)
C. Mongenet, G.-R. Perrin, “Synthesis of systolic arrays for inductive problems”, L.N.C.S. 258, pp. 260–277 (1987)
M. Ossefort, “Correctness Proofs of Communicating Processes: Three Illustrative Examples from the Literature”, ACM Toplas 5, pp. 620–640 (1983)
S.V. Rajopadhye, R.M. Fujimoto, “Systolic array synthesis by static analysis of program dependencies”, L.N.C.S. 258, pp. 295–310 (1987)
M. Rem, “Trace theory and systolic computations”, L.N.C.S. 258, pp. 14–33 (1987)
J.L.A. van de Snepscheut, J.B. Swenker, “On the Design of Some Systolic Algorithms”, J.ACM 36, pp. 826–840 (1989)
V. Van Dongen, “Mapping uniform recurrences onto small size arrays” L.N.C.S. 505, pp. 191–208 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gribomont, P., Van Dongen, V. (1993). Generic systolic arrays: A methodology for systolic design. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_102
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive