Given's rotation on an instruction systolic array | SpringerLink
Skip to main content
Springer Nature Link
Log in

Given's rotation on an instruction systolic array

  • Submitted Papers
  • Conference paper
  • First Online:
Parcella '88 (Parcella 1988)

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

Abstract

In this paper we show that the concept of instruction systolic arrays allows to implement efficiently a transformation scheme for triangularizing rectangular m×n-matrices using Given's rotations. Based on a careful choice of an appropriate set of instructions, a program for the instruction systolic array can be designed having a time complexity of O(min(n,m-1)). Although the instruction systolic array allows for much greater flexibility, the time complexity is of the same order as that of the special purpose triangular systolic array designed by Gentleman and Kung.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dittrich, A.: Matrixoperationen auf dem befehlssystolischen Feld. Diplomarbeit. Institut für Informatik und Praktische Mathematik, Universität Kiel, 1988.

    Google Scholar 

  2. Gentleman, W.M., and H.T. Kung: Matrix Triangularisation by Systolic Arrays. In: Proc. SPIE Symp., vol. 298, Real-Time Signal Processing IV (1981), 19–26.

    Google Scholar 

  3. Golub, G.H., and C.F. Van Loan: Matrix Computations. The John Hopkins University Press, Baltimore, 1985.

    Google Scholar 

  4. Kunde, M., H.-W. Lang, M. Schimmler, H. Schmeck, and H. Schröder: The Instruction Systolic Array and Its Relation to Other Models of Parallel Computers. In: M. Feilmeier, G. Joubert, and U. Schendel (eds.): Parallel Computing '85, North-Holland (1986), 408–419.

    Google Scholar 

  5. Lang, H.-W.: The Instruction Systolic Array, a Parallel Architecture for VLSI. Integration, the VLSI Journal 4 (1986), 65–74.

    Google Scholar 

  6. Lang, H.-W.: Transitive Closure on an Instruction Systolic Array. Bericht 8718, Informatik und Praktische Mathematik, Universität Kiel, 1987.

    Google Scholar 

  7. Makait, J.: Sortieren auf dem befehlssystolischen Feld. Diplomarbeit, Institut für Informatik und Praktische Mathematik, Universität Kiel, 1987.

    Google Scholar 

  8. Robert, Y.: Systolic Algorithms and Architectures. RR 621-I, CNRS, Lab. TIM3, Institut National Polytechnique de Grenoble, 1986.

    Google Scholar 

  9. Schimmler, M.: Fast Sorting on the Instruction Systolic Array. Bericht 8709, Informatik und Praktische Mathematik, Universität Kiel, 1987.

    Google Scholar 

  10. Schimmler, M., Schröder, H.: Finding All Cut-Points on the Instruction Systolic Array. Bericht 8717, Institut für Informatik und Praktische Mathematik, Universität Kiel, 1987.

    Google Scholar 

  11. Schmeck, H.: A Comparison-Based Instruction Systolic Array. In: M. Cosnard, Y. Robert, P. Quinton, M. Tchuente (eds.): Parallel Algorithms and Architectures, North-Holland, Amsterdam (1986), 281–292.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik u.P.M., Universität Kiel, D-2300, Kiel 1, Federal Republic of Germany

    Hartmut Schmeck

Authors
  1. Andreas Dittrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hartmut Schmeck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Wolf Tamáas Legendi Udo Schendel

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dittrich, A., Schmeck, H. (1989). Given's rotation on an instruction systolic array. In: Wolf, G., Legendi, T., Schendel, U. (eds) Parcella '88. Parcella 1988. Lecture Notes in Computer Science, vol 342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50647-0_127

Download citation

  • DOI: https://doi.org/10.1007/3-540-50647-0_127

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50647-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation