Skip to main content
SpringerLink
Log in

A Systolic Program for Gauss-Jordan Elimination

  • Chapter
Beauty Is Our Business

Part of the book series: Texts and Monographs in Computer Science ((MCS))

  • 378 Accesses

Abstract

A scheme for the compilation of imperative or functional programs into systolic programs is used to derive a distributed program for Gauss-Jordan elimination from a Pascal-like program.

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

Access this chapter

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Prison, P. Gachet, and P. Quinton. Designing systolic arrays with DIASTOL. VLSI Signal Processing II, 93–105, 1986. IEEE Press.

    Google Scholar 

  2. C.-H. Huang and C. Lengauer. The derivation of systolic implementations of programs. Acta Informatica, 24 (6): 595–632, Nov. 1987.

    Article  MathSciNet  MATH  Google Scholar 

  3. C.-H. Huang and C. Lengauer. Mechanically derived systolic solutions to the algebraic path problem. To appear in Acta Informatics, extended abstract in VLSI and Computers (CompEuro 87), W. E. Proebster and H. Reiner (eds.), IEEE Computer Society Press, 1987, 307–310.

    Google Scholar 

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

    Google Scholar 

  5. H. T. Kung and C. E. Leiserson. Algorithms for VLSI processor arrays. In C. Mead and L. Conway, editors, Introduction to VLSI Systems, Addison-Wesley, 1980. Sect. 8. 3.

    Google Scholar 

  6. C. Lengauer. Towards systolizing compilation: an overview. In E. Odijk, M. Rem, and J.-C. Syre, editors, Proc. Parallel Architectures and Languages Europe (PARLE’89) Vol II: Parallel Languages, pages 253–272, Springer-Verlag, 1989. Lecture Notes in Computer Science 366.

    Google Scholar 

  7. P. Quinton. Mapping recurrences on parallel architectures. In L. P. and S. I. Kartashev, editors, Third Int. Conf. on Supercomputing (ICS 88), Vol III: Supercomputer Design: Hardware & Software, pages 1–8, Int. Supercomputing Institute, Inc., 1988.

    Google Scholar 

  8. Y. Robert and D. Trystram. An orthogonal systolic array for the algebraic path problem. Computing, 39 (3): 187–199, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  9. G. Rote. A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion). Computing, 34 (3): 191–219, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  10. U. Zimmermann. Linear and Combinatorial Optimization in Ordered Algebraic Structures. Volume 10 of Annals of Discrete Mathematics, North-Holland Publ. Co., 1981. Sect. 8.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, The King’s Buildings, Mayfield Road, Edinburgh, EH9 3JZ, Scotland, UK

    Christian Lengauer

  2. Department of Computer Sciences, The University of Texas at Austin, Taylor Hall 2.124, Austin, Texas, 78712-1188, USA

    Duncan G. Hudson

Authors
  1. Christian Lengauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Duncan G. Hudson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematics and Computer Science Department, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

    W. H. J. Feijen

  2. Department of Computer Science, University of Utrecht, 3508 TB, Utrecht, The Netherlands

    A. J. M. van Gasteren

  3. Department of Computer Science, Cornell University, 14853, Ithaca, NY, USA

    D. Gries

  4. Department of Computer Science, The University of Texas, 78712-1188, Austin, TX, USA

    J. Misra

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Lengauer, C., Hudson, D.G. (1990). A Systolic Program for Gauss-Jordan Elimination. In: Feijen, W.H.J., van Gasteren, A.J.M., Gries, D., Misra, J. (eds) Beauty Is Our Business. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4476-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4476-9_31

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8792-6

  • Online ISBN: 978-1-4612-4476-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation