Abstract
We present a method to find mappings of systolic algorithms that use the minimal number of processors. This method is based on geometrical interpretations on the convex polyhedra in Zn. We use our results to derive two space-optimal mappings for the Gaussian elimination algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H.T. Kung, “Why Systolic Architectures?”Computer, vol. 15-1, 1982, pp. 37–46.
S.Y. Kung, S.C. Lo and P.S. Lewis, “Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems”,IEEE Transactions on Computers, vol. C 36, 1987, pp. 603–614.
Y. Robert, “Systolic Algorithms and Architectures”, in (F. Folgelman-Soulie et al., eds),Automata Networks in Computer Science, Manchester: Manchester University Press, 1987, pp. 187–228.
P. Clauss and G.R. Perrin,Synthesis of Process Arrays, Conpar '88, Manchester, September 1988, Cambridge: Cambridge University Press.
J.A.B. Fortes and K.S. Fu, “Systemic Approaches to the Design of Algorithmically Specified Systolic Arrays”,Proc. ICASSP 1985, pp. 8.9.1–4.
C.H. Huang and C. Lengauer, “An Implemented Method for Incremental Design”, Conf. PARLE, Eindhoven, LNCS 259, 1987, pp. 160–177.
C. Mongenet, “Une Méthode de Conception d'Algorithmes Systoliques, Résultats Théoriques et Réalisation”, Thesis, University of Nancy, 1985.
D.I. Moldovan, “Advis, a Software Package for the Design of Systolic Arrays”,Proceedings 1984 IEEE ICCD: VLSI in Computers, 1984, pp. 158–164.
P. Quinton, “Automatic Synthesis of Systolic Arrays from Uniform Recurrent Equations”,Proc. IEEE 11th Int'l. Symp. on Computer Architecture, Ann Arbor, MI, 1984, pp. 208–214.
S.V. Rajopadhye and R.M. Fujimoto, “Systolic Array Synthesis by Static Analysis of Program Dependencies”, Conf. PARLE, Eindhoven, LNCS 259, 1987, pp. 295–310.
P. Gachet, B. Joinnault and P. Quinton, “Synthesizing Systolic Arrays Using Diastol”, In (W. Moore, A. McCabe, R. Urquhart, eds.),International Workshop on Systolic Arrays, Adam Hilger, University of Oxford, July 2–4, 1986, pp. 25–36.
P. Clauss, “Synthese d'Algorithmes Systoliques et Implantation Optimale en place sur Réseaux de Processeurs Synchrones”, PhD Thesis, University of Franche-Comté, May 1990.
P. Clauss, “Mapping Systolic Algorithms on Processor Arrays”, Research Report, Lab. Informatique Besançon, January 1989.
G.R. Perrin, P. Clauss and S. Damy, “Mapping Programs on Regular Distributed Architectures”,Hypercube and Distributed Computers, Amsterdam: Elsevier Science, 1989.
G.R. Perrin, “Parallel Solutions for Equation System”,Int'l. Workshop on Parallel and Distributed Algorithms, Bonas, Amsterdam: Elsevier Science, 1988.
Y. Wong and J.-M. Delosme, “Optimization of Processor Count for Systolic Arrays”, Research Report YALEU/DCS/RR-697, May 1989.
H.T. Kung and C.E. Leiserson, “Systolic Arrays for VLSI”, Sparse Matrix Proceedings,SIAM, 1978, pp. 245–282.
T. Fountain, “Processor Arrays: Architecture and Applications”,Microelectronics and Signal Processing, London: Academic Press, 1987.
J. Hopcroft and R. Tarjan, “Efficient Planarity Testing”,JACM, vol. 21, 1974, pp. 549–568.
N. Chiba, K. Onoguchi and T. Nishizeki, “Drawing Plane Graphs Nicely”,Acta Informatica, vol. 22, 1985, pp. 187–201.
Author information
Authors and Affiliations
Additional information
This work is supported by the French coordinated research program C3 of the CNRS.
Rights and permissions
About this article
Cite this article
Clauss, P., Mongenet, C. & Perrin, Gr. Calculus of space-optimal mappings of systolic algorithms on processor arrays. J VLSI Sign Process Syst Sign Image Video Technol 4, 27–36 (1992). https://doi.org/10.1007/BF00930616
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00930616