Skip to main content
SpringerLink
Log in
Book cover

GI — 20. Jahrestagung II pp 527–536Cite as

Wie kann man imperative Programme auf eine Systolisierung vorbereiten?

  • Conference paper

  • 142 Accesses

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 258))

Zusammenfassung

Ein systolisches Netz [14] ist ein besonders reguläres Prozessorennetzwerk, das große Datenmengen durch parallele Eingabe, Berechnung und Ausgabe bewältigen kann. Anwendungsbereiche sind Bild-und Signalverarbeitung, Textverarbeitung, Meteorologie, Medizin, Numerik und andere. Systolische Netze eignen sich besonders zur Realisierung in VLSI-Chips, die auf engstem Raum (z.B. in Satelliten) komplizierte und daten-intensive Funktionen übernehmen.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. R. C. Backhouse, Program Construction and Verification, Series in Computer Science, Prentice-Hall Int., 1986.

    Google Scholar 

  2. J.-P. Banatre, A. Coutant and D. Le Metayer, “A Parallel Machine for Multiset Transformation and Its Programming Style”, Future Generation Computer Systems 4, 2 (Sept. 1988), 133–144.

    Article  Google Scholar 

  3. K. M. Chandy and J. Misra, Parallel Program Design, Addison-Wesley, 1988.

    MATH  Google Scholar 

  4. E. W. Dijkstra, A Discipline of Programming, Series in Automatic Computation, Prentice-Hall, 1976.

    MATH  Google Scholar 

  5. V. van Dongen and P. Quinton, “Uniformization of Linear Recurrence Equations: A Step Towards the Automatic Synthesis of Systolic Arrays”, Proc. Int. Conf. on Systolic Arrays, K. Bromley, S.-Y. Kung and E. Swartzlander (eds.), IEEE Computer Society, 1988, 473–482.

    Google Scholar 

  6. B. R. Engstrom and P. R. Cappello, “The SDEF Systolic Programming System”, J. Parallel and Distributed Computing 7, 2 (Oct. 1989), 201–231.

    Article  Google Scholar 

  7. J. A. B. Fortes, K.-S. Fu and B. W. Wah, “Systematic Design Approaches for Algorithmically Specified Systolic Arrays”, in Computer Architecture — Concepts and Systems, V. M. Milutinovic (ed.), North-HoUand, 1988, Chap. 11.

    Google Scholar 

  8. P. Frison, P. Gachet and P. Quinton, “Designing Systolic Arrays with DIASTOL”, in VLSI Signal Processing II, S.-Y. Kung, R. E. Owen and J. G. Nash (eds.), IEEE Press, 1986, 93–105.

    Google Scholar 

  9. D. Gries, The Science of Programming, Texts and Monographs in Computer Science, Springer-Verlag, 1981.

    MATH  Google Scholar 

  10. E. C. R. Hehner, The Logic of Programming, Series in Computer Science, Prentice-Hall Int., 1984.

    Google Scholar 

  11. C.-H. Huang, “The Mechanically Certified Derivation of Concurrency and its Application to Systolic Design”, Ph. D. Thesis, Department of Computer Sciences, The University of Texas at Austin, Aug. 1987.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. C.-H. Huang and C. Lengauer, “An Incremental Mechanical Development of Systolic Solutions to the Algebraic Path Problem”, Acta Informatica 21, 2 (Nov. 1989), 97–124.

    Article  Google Scholar 

  14. 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 

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

    MathSciNet  Google Scholar 

  16. C. Lengauer, “Towards Systolizing Compilation: An Overview”, Proc. Parallel Architectures and Languages Europe (PARLE ‘89), E. Odijk, M. Rem and J.-C. Syre (eds.), Vol. II: Parallel Languages, Lecture Notes in Computer Science 366, Springer-Verlag, 1989, 253–272.

    Google Scholar 

  17. C. Lengauer, “Code Generation for a Systolic Computer”, Software—Practice & Experience 20, 3 (Mar. 1990), 261–282.

    Article  MathSciNet  Google Scholar 

  18. C. Lengauer and D. G. Hudson, “A Systolic Program for Gauss-Jordan Elimination”, in Beauty is our Business, W. H. J. Feijen, A. J. M. van Gasteren, D. Gries and J. Misra (eds.), Texts and Monographs in Computer Science, Springer-Verlag, 1990, Chap. 6.

    Google Scholar 

  19. C. Lengauer, B. Sabata and F. Arman, “A Mechanically Derived Systolic Implementation of Pyramid Initialization”, Proc. Workshop on Hardware Specification, Verification and Synthesis: Mathematical Aspects, G. Brown and M. Leeser (eds.), Lecture Notes in Computer Science 406, Springer-Verlag, 1990, 90–105.

    Google Scholar 

  20. C. Lengauer and J. W. Sanders, “The Projection of Systolic Programs”, Proc. Mathematics of Program Construction, J. L. A. van de Snepscheut (ed.), Lecture Notes in Computer Science 375, Springer-Verlag, 1989, 307–324.

    Google Scholar 

  21. C. Lengauer and J. Xue, “A Systolic Array for Pyramidal Algorithms”, Tech. Report ECS-LFCS-90-114, Department of Computer Science, University of Edinburgh, May 1990.

    Google Scholar 

  22. P. Quinton and V. van Dongen, “The Mapping of Linear Recurrence Equations on Regular Arrays”, J. VLSI Signal Processing 1, 2 (Oct. 1989), 95–113.

    Article  MATH  Google Scholar 

  23. S. K. Rao, “Regular Iterative Algorithms and their Implementations on Processor Arrays”, Ph. D. Thesis, Department of Electrical Engineering, Stanford University, Oct. 1985.

    Google Scholar 

  24. Y. Robert and D. Trystram, “An Orthogonal Systolic Array for the Algebraic Path Problem”, Computing 39, 3 (1987), 187–199.

    Article  MATH  MathSciNet  Google Scholar 

  25. G. Rote, “A Systolic Array Algorithm for the Algebraic Path Problem (Shortest Paths; Matrix Inversion)”, J. Computing 34, 3 (1985), 191–219.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, Edinburgh, Scotland

    Christian Lengauer

Authors
  1. Christian Lengauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Parallele und Verteilte Höchstleistungsrechner, Universität Stuttgart, Herdweg 51, D-7000, Stuttgart 1, Deutschland

    A. Reuter

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lengauer, C. (1990). Wie kann man imperative Programme auf eine Systolisierung vorbereiten?. In: Reuter, A. (eds) GI — 20. Jahrestagung II. Informatik-Fachberichte, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76119-5_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76119-5_56

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-76119-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation