Skip to main content

The projection of systolic programs

  • Contributed Lectures
  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1989)

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

Included in the following conference series:

Abstract

A scheme is presented which transforms systolic programs with a two-dimensional structure to one dimension. The elementary steps of the transformation are justified by theorems in the theory of communicating sequential processes and the scheme is demonstrated with an example in occam: matrix composition/decomposition.

On leave from the Department of Computer Sciences, The University of Texas at Austin, Taylor Hall 2.124, Austin, Texas 78712-1188.

Supported in part by the following funding agencies: through Oxford University by the Science and Engineering Research Council under Contract GR/E 63902; through the University of Texas at Austin by the Office of Naval Research under Contract N00014-86-K-0763, and by the National Science Foundation under Contract DCR-8610427.

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.

7 References

  1. C. A. R. Hoare, Communicating Sequential Processes, Series in Computer Science, Prentice-Hall Int., 1985.

    Google Scholar 

  2. C. A. R. Hoare, He Jifeng and J. W. Sanders, “Prespecification in Data Refinement”, Information Processing Letters 25, 2 (May 1987), 71–76.

    Google Scholar 

  3. C.-H. Huang and C. Lengauer, “The Derivation of Systolic Implementations of Programs”, Acta Informatica 24, 6 (Nov. 1987), 595–632.

    MathSciNet  Google Scholar 

  4. INMOS Ltd., occam Programming Manual, Series in Computer Science, Prentice-Hall Int., 1984.

    Google Scholar 

  5. J. L. Jacob, “On Shared Systems”, D. Phil. Thesis, Programming Research Group, Oxford University Computing Laboratory, 1987.

    Google Scholar 

  6. H. T. Kung and C. E. Leiserson, “Algorithms for VLSI Processor Arrays”, in Introduction to VLSI Systems, C. Mead and L. Conway (eds.), Addison-Wesley, 1980, Sect. 8.3.

    Google Scholar 

  7. P. Lee, Z. Kedem, “Synthesizing Linear Array Algorithms from Nested for Loop Algorithms”, IEEE Trans. on Computers TC-37, 12 (Dec. 1988), 1578–1598.

    Google Scholar 

  8. C. Lengauer, “Towards Systolizing Compilation: An Overview”, Proc. Conf. on Parallel Architectures and Languages Europe (PARLE 89), June 1989, to appear as Springer-Verlag Lecture Notes in Computer Science.

    Google Scholar 

  9. D. I. Moldovan and J. A. B. Fortes, “Partitioning and Mapping Algorithms into Fixed-Size Systolic Arrays”, IEEE Trans. on Computers C-35, 1 (Jan. 1986), 1–12.

    Google Scholar 

  10. T. Nipkow, “Non-Determinstic Data Types”, Acta Informatica 22, 6 (Mar. 1986), 629–661.

    Article  Google Scholar 

  11. A. W. Roscoe and C. A. R. Hoare, “The Laws of occam Programming”, Theoretical Computer Science 60, 2 (1988), 177ff.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. L. A. van de Snepscheut

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lengauer, C., Sanders, J.W. (1989). The projection of systolic programs. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-51305-1_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51305-6

  • Online ISBN: 978-3-540-46191-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics