Change search
ReferencesLink to record
Permanent link

Direct link
VLSI Algorithms for Doolittle’s, Crout’s and Cholesky’s Methods
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1982 (English)Conference paper (Refereed)
Abstract [en]

In order to take full advantage of the emerging VLSI technology it is required to recognize its limited communication capability and structure algorithms accordingly. In this paper concurrent algorithms for the methods of Crout, Doolittle and Cholesky are described and compared with concurrent algorithms for Gauss', Given's and Householder's method. The effect of pipelining the computations in two dimensional arrays is given special attention.

Place, publisher, year, edition, pages
1982. 372-377 p.
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-65765OAI: diva2:483667
the International Conference on Circuits and Computers, ICCC 82
NR 20140805Available from: 2012-01-25 Created: 2012-01-25Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 19 hits
ReferencesLink to record
Permanent link

Direct link