Affine timings for systems of affine recurrence equations

  • C. Mongenet
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 505)


This paper is devoted to the problem of the existence of affine timings for problems defined by Systems of Affine Recurrence Equations. After a first analysis, such problems may have no affine timing not because the problem is uncomputable but only because of the initial system of equations. This system can induce dependencies organized in an inappropriate way. We give conditions for a dependency to be well-organized in such a way that an affine timing may exist. When a dependency does not satisfy these conditions, we describe how to transform it in order to meet the conditions. A problem defined by a system of equations is analyzed by a step-by-step examination of its dependencies. For each dependency organized in an inappropriate way, a transformation is applied. The whole transformation process yields to the determination of a new equivalent system of equations from which an affine timing can usually be computed. Many practical problems need such transformations. We illustrate this transformation process on the Algebraic Path Problem.


systems of affine recurrence equations affine timing functions mapping systolic arrays processor arrays 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BE-all89]
    Benaini A., Quinton P., Robert Y., Saouter Y., Tourancheau B. — Synthesis of a new Systolic Architecture for the Algebraic Path Problem, IRISA Research Report,No 1094, 1989.Google Scholar
  2. [CLP 88]
    Clauss Ph., Perrin G.R. — Synthesis of Process Arrays, CONPAR'88, Manchester, G.B., 1988.Google Scholar
  3. [DEI 85]
    Delosme J.M., Ipsen I.C.F. — An Illustration of a Methodology for the Construction of Efficient Systolic Architectures in VLSI, Sd. Int. Symposium on VSLI Technology, Systems and Applications, Taipei, Taiwan, R.O.C., 1985, p. 268–273.Google Scholar
  4. [DEL 88]
    Delosme J.M. — A Parallel Algorithm for the Algebraic Path Problem, Int. Workshop on Parallel and Distributed Algorithms, M. Cosnard et al. editors, North-Holland, 1988.Google Scholar
  5. [FFW 87]
    Fortes J.A.B., Fu K.S., Wah B.W. — Systematic Approaches to the Design of Algorithmically Specified Systolic Arrays, Int. Conf. on Acoustics, Speech and Signal Processing, 1987.Google Scholar
  6. [KMW 67]
    Karp R.M., Miller R.E., Winograd S. — The Organization of Computations for Uniform Recurrence Equations, JACM, t. 14,3, 1967.Google Scholar
  7. [KUN 82]
    Kung H.T. — Why systolic architectures?, Computer, t. 15-1, 1982, p. 37–46.Google Scholar
  8. [MCP 90]
    Mongenet C., Clauss Ph., Perrin G.R. — Geometrical Tools to map Systems of Affine Recurrence Equations on Regular Arrays, Research Report, LIB, Université de Franche-Comté, 1990.Google Scholar
  9. [MCP 91]
    Mongenet C., Clauss Ph., Perrin G.R. — A Geometrical Cding to Compile Affine Recurrence Equations on Regular Arrays, Fifth Int. Parallel Processing Symposium, Anaheim, California, 1991.Google Scholar
  10. [MOF 86]
    Moldovan D.I., Fortes J.A.B. — Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays, IEEE Transactions on Computers, t. 35-1, 1986, p. 1–12.Google Scholar
  11. [MOL 83]
    Moldovan D.I. — On the Design of Algorithms for VLSI Systolic Arrays, Proc IEEE conf., t. 71-1, 1983, p. 113–120.Google Scholar
  12. [MON 85]
    Mongenet C. — Une Méthode de Conception d'Algorithmes Systoliques, Résultats Théoriques et réalisation, Thèse INPL, Nancy, 1985.Google Scholar
  13. [MOP 87]
    Mongenet C., Perrin G.R. — Synthesis of Systolic Arrays for Inductive Problems, Conf. PARLE, LNCS 259, 1987.Google Scholar
  14. [QUI 84]
    Quinton P. — Automatic Synthesis of Systolic Arrays from Uniform Recurrence Equations, Proc. IEEE 11th Int. Symp. on Computer Architecture,Ann Arbor,MI,USA, 1984, p. 208–214.Google Scholar
  15. [QVD 89]
    Quinton P., Van Dongen V. — The Mapping of Linear Recurrence Equations on Regular Arrays, The Journal of VLSI Signal Processing, t. 1, 1989, p. 95–113.Google Scholar
  16. [ROT 87]
    Robert Y., Trystram D. — Systolic Solution of the Algebraic Problem, Int. Workshop on Systolic Arrays, Oxford, Adam-Hilger, 1987, p. 171–180.Google Scholar
  17. [SAQ 90]
    Saouter Y., Quinton P. — Computability of Recurrence Equations, TR-1203, IRISA, Rennes, 1990.Google Scholar
  18. [YAC 88]
    Yaacobi Y., Cappello P.R. — Scheduling a System of Affine Recurrence Equations onto a Systolic Array, Int. Conf. on Systolic Arrays, San Diego, USA, 1988, p. 373–382.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • C. Mongenet
    • 1
  1. 1.Département d'InformatiqueUniversité Louis PasteurStrasbourgFrance

Personalised recommendations