Skip to main content

A unifying framework for systolic designs

  • Conference paper
  • First Online:
Book cover VLSI Algorithms and Architectures (AWOC 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 227))

Included in the following conference series:

Abstract

A systematic methodology to synthesize systolic designs is described and used to derive a new design for dynamic programming. This latter design uses fewer processing elements than previously considered ones. The synthesis method consists of two parts: 1) deriving from the high-level problem specification a form more suitable to VLSI implementation; 2) mapping the new specification into physical hardware. The method also provides a unifying framework for existing systolic algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, M. "Synthesizing Systolic Designs" In Proc. Int. Symp. on VLSI Technology, Systems and Applications, Taipei-Taiwan, May 85.

    Google Scholar 

  2. Fortes, J.A.B., Fu, K.S., and Wah, B.W. "Systematic Approaches to the Design of Algorithmically Specified Systolic Arrays", Tech. Rep., Purdue Univ.

    Google Scholar 

  3. Fortes, J.A.B. and Moldovan, D.I. "Parallelism Detection and Algorithm Transformation Techniques Useful for VLSI Architecture Design" J. Parallel Distrib. Comput., May 1985.

    Google Scholar 

  4. Guerra, C. and Melhem, R. "Synthesizing Non-uniform Systolic Designs" Tech. Rep., Dept. Comp. Sc., Purdue Univ. (submitted for publication)

    Google Scholar 

  5. Guibas, L.J., Kung, H.T. and Thompson, C.D. "Direct VLSI Implementation of Combinatorial Algorithms" Proc. of Caltech Conf. on VLSI, 1979.

    Google Scholar 

  6. Leiserson, C., Saxe, F. "Optimizing synchronous systems" VLSI Algorithms, 1984.

    Google Scholar 

  7. Kung, H.T. and Lin, W. "An Algebra for VLSI Algorithm Design" Proc. Conf. on Elliptic Problem Solvers, 1983.

    Google Scholar 

  8. Kunh, R.H. "Transforming Algorithms for Single-Stage and VLSI Architectures" Workshop on Interconnection Networks for Parallel and Distributed Processing, 1980.

    Google Scholar 

  9. Lam, M. and Mostow, J. "A Transformational Model of VLSI Systolic Design" Computer, pp. 42–52, 1985.

    Google Scholar 

  10. Melhem, R. and Guerra, C. "The Application of a Sequence Notation to the Design of Systolic Computations" Techn. Rep. 568 Dept. Comp. Sc., Purdue University.

    Google Scholar 

  11. Moldovan, D. "On the Analysis and Synthesis of VLSI Algorithms" IEEE Trans. on Computers, C-31, pp. 1121–1126, 1982.

    Google Scholar 

  12. Moldovan, D. "On the Design of Algorithms for VLSI Systolic Arrays" Proc. IEEE, vol. 71, pp. 113–120, Jan 1983.

    Google Scholar 

  13. Quinton, P. "Automatic Synthesis of Systolic Arrays from Uniform Recurrent Equations" Proc. 11-th Annual Symp. on Computer Architecture, pp. 208–214, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Filia Makedon Kurt Mehlhorn T. Papatheodorou P. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guerra, C. (1986). A unifying framework for systolic designs. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds) VLSI Algorithms and Architectures. AWOC 1986. Lecture Notes in Computer Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16766-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-16766-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16766-2

  • Online ISBN: 978-3-540-38746-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics