Skip to main content
SpringerLink
Log in

Solution of dense systems of linear equations using cellular processors

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

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

  • 128 Accesses

Abstract

A cellular processor is a totally reconfigurable universal purpose device for highly parallel processing, where computations are performed by a homogeneous array of microprogrammable Boolean processors [6].

In this paper three cellular algorithms are proposed for solving dense systems of linear equations. For simplicity these algorithms are given as systolic arrays, but our attention is focussed on their implementation with cellular processors.

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.

References

  1. Boyanczyk, A.-Brent, R.P.—Kung, H.T.: Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-connected Processors, Carnegie-Mellon Univ. /1981/ 21.

    Google Scholar 

  2. Hwang, K.—Cheng, Y.H.: Partitioned Matrix Algorithms for VISI Arithmetic Systems, IEEE Trans. on Comp., Vol. C-31. No. 12 /1982/ 1215–24.

    Google Scholar 

  3. Katona, E.: A Programming Language for Cellular Processors, Proc. of Conf. "Parallel Computing'85", W-Berlin /1986/ North-Holland.

    Google Scholar 

  4. Katona, E.: A General Partitioning Method for Cellular Algorithms, Proc. of the 4th Cellular Meeting, T.U. Braunschweig /1988/.

    Google Scholar 

  5. Kung, H.T.—Leierson, C.E.: Systolic Arrays /for VLSI/, Carnegie-Mellon Univ. /1978/ 32.

    Google Scholar 

  6. Legendi, T.: Cellprocessors in Computer Architecture, Computational Linguistics and Computer Languages 11 /1977/ 147–167.

    Google Scholar 

  7. Miklosko, J.: Four Specialized VISI Computers for the Fast Gauss-Jordan-Rutishauer Elimination Algorithm with Partial Pivoting, Computers and Artificial Intelligence, 4 /1985/, No. 2, 163–186.

    Google Scholar 

  8. Palágyi, K.: Computing Matrix Problems on Cellular Processors, Thesis, József A. Univ., Szeged /1894/, in Hungarian.

    Google Scholar 

  9. Robert, Y.—Trystram, D.: Parallel Implementation of the Algebraic Path Problem, Proc. of the Conf. "Conpar'86", Aachen /1986/ 149–56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Attila József University, Somogyi u. 7., H-6720, Szeged, Hungary

    Kálmán Palágyi

Authors
  1. Kálmán Palágyi
    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

Palágyi, K. (1989). Solution of dense systems of linear equations using cellular processors. 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_123

Download citation

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

  • 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