ACM Home Page
Please provide us with feedback. Feedback
The computation and communication complexity of a parallel banded system solver
Full text PdfPdf (497 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 10 ,  Issue 2  (June 1984) table of contents
Pages: 185 - 195  
Year of Publication: 1984
ISSN:0098-3500
Authors
D H. Lawrie  University of Illinois at Urbana-Champaign
A H. Sameh  University of Illinois at Urbana-Champaign
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 9
Additional Information:

references   cited by   index terms   review   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/399.401
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
LAWRIE, D. H. Access and alignment of data in an array processor. IEEE Trans. Comput. C-24, 12 (Dec 1975), 1145-1155.
 
2
SAMEH, A. Parallel algorithms in numerical linear algebra. In Proceedings of the CREST Con/erence on Design o{ Numerical Algorithms for Parallel Processing (Bergamo, |taly, 1981), Academic Press (to appear)
3
4

CITED BY  9


REVIEW

"Thomas L. Clarke : Reviewer"

Future generations of super-computers will probably rely on multiple processor architectures to avoid the von Neumann bottleneck and the physical limitation of the speed of light. Lawrie and Sameh's paper addresses the problem of how to efficie  more...