Published 1982
| public
Report
Open
VLSI algorithms for Doolittle's, Crout's, and Cholesky's methods
- Creators
- Johnsson, Lennart
Abstract
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 pipe lining the computations in two dimensional arrays is given special attention.
Additional Information
this paper will appear in Proc. IEEE International Conference on Circuits and Computers, ICCC 82 New York, September 29 - October 1, 1982. The author gratefully acknowledges the support provided by the Defense Advanced Research Project Agency, order 3771, and monitored by the Office of Naval Research under contract N00014-79-C-0597. Views and conclusions contained in this paper are the author's and should not be interpreted as representing the official opinion of DARPA, the u.s. Government, nor any person or agency connected with them.Files
TM_5030.pdf
Files
(1.5 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:4e7e5925dc63bea4c87c7214c845e1ec
|
1.5 MB | Preview Download |
Additional details
- Eprint ID
- 30221
- Resolver ID
- CaltechAUTHORS:20120420-105611583
- Defense Advanced Research Project Agency
- 3771
- Office of Naval Research
- N00014-79-C-0597
- Created
-
2012-05-02Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Other Numbering System Name
- Computer Science Technical Memorandum
- Other Numbering System Identifier
- 5030