ACM Home Page
Please provide us with feedback. Feedback
Squeezing the most out of an algorithm in CRAY FORTRAN
Full text PdfPdf (440 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 10 ,  Issue 3  (September 1984) table of contents
Pages: 219 - 230  
Year of Publication: 1984
ISSN:0098-3500
Authors
Jack J. Dongarra  Argone National Laboratory
Stanley C. Eisenstat  Yale University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 19
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1271.319413
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
DONGARRA, J. J., AND HINDS. A.R. Unrolhng, loops in FORTRAN. So#ware--Practice and Experience 9 (1979), 219-229.
 
2
DUFF, I.S. The solution of sparse linear equations on the CRAY-1. CRA Y Channels 4, 3 (1982), 4-9.
 
3
DUFF, I. S., AND REID, J.K. Experience of sparse matrix codes on the CRAY-1. Comput Phys. Commun. 26 (1982), 293-302.
 
4
FONG, K., AND JORDAN, T. L. Some hnear algebra algorithms and their performance on the CRAY-1. UC-32. Los Alamos Scientific Laboratory, June 1977.
5
 
6
ORBITS, D. A., AND CALAHAN, V.A. Data flow considerations in implementing a full matrix solver with backing store on the CRAY-1. Systems Engineering Laboratory Rep. 98 Univ. of Michigan, Sept. 1976.

CITED BY  19

Collaborative Colleagues:
Jack J. Dongarra: colleagues
Stanley C. Eisenstat: colleagues