Loading...
Please wait, while we are loading the content...
Similar Documents
Parallel matrix multiplication on the connection machine
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Tichy, Walter F. |
| Copyright Year | 1988 |
| Description | Matrix multiplication is a computation and communication intensive problem. Six parallel algorithms for matrix multiplication on the Connection Machine are presented and compared with respect to their performance and processor usage. For n by n matrices, the algorithms have theoretical running times of O(n to the 2nd power log n), O(n log n), O(n), and O(log n), and require n, n to the 2nd power, n to the 2nd power, and n to the 3rd power processors, respectively. With careful attention to communication patterns, the theoretically predicted runtimes can indeed be achieved in practice. The parallel algorithms illustrate the tradeoffs between performance, communication cost, and processor usage. |
| File Size | 1470454 |
| Page Count | 42 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19890017256 |
| Archival Resource Key | ark:/13960/t88h3hp3d |
| Language | English |
| Publisher Date | 1988-11-01 |
| Access Restriction | Open |
| Subject Keyword | Numerical Analysis Multiplication Hypercube Multiprocessors Computer Systems Performance Very Large Scale Integration Architecture Computers Lisp Programming Language Parallel Processing Computers Algorithms Computation C Programming Language Problem Solving Massively Parallel Processors Systolic Arrays Matrices Mathematics Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |
