Advertisement

A unifying framework for systolic designs

  • Concettina Guerra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 227)

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.

Keywords

Dynamic Programming Processing Element Global Constraint Systolic Array Index Vector 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Chen, M. "Synthesizing Systolic Designs" In Proc. Int. Symp. on VLSI Technology, Systems and Applications, Taipei-Taiwan, May 85.Google Scholar
  2. [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. [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. [4]
    Guerra, C. and Melhem, R. "Synthesizing Non-uniform Systolic Designs" Tech. Rep., Dept. Comp. Sc., Purdue Univ. (submitted for publication)Google Scholar
  5. [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. [6]
    Leiserson, C., Saxe, F. "Optimizing synchronous systems" VLSI Algorithms, 1984.Google Scholar
  7. [7]
    Kung, H.T. and Lin, W. "An Algebra for VLSI Algorithm Design" Proc. Conf. on Elliptic Problem Solvers, 1983.Google Scholar
  8. [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. [9]
    Lam, M. and Mostow, J. "A Transformational Model of VLSI Systolic Design" Computer, pp. 42–52, 1985.Google Scholar
  10. [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. [11]
    Moldovan, D. "On the Analysis and Synthesis of VLSI Algorithms" IEEE Trans. on Computers, C-31, pp. 1121–1126, 1982.Google Scholar
  12. [12]
    Moldovan, D. "On the Design of Algorithms for VLSI Systolic Arrays" Proc. IEEE, vol. 71, pp. 113–120, Jan 1983.Google Scholar
  13. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Concettina Guerra
    • 1
  1. 1.Department of Computer SciencesPurdue UniversityWest lafayette

Personalised recommendations