Communication and Matrix Computations on Large Message Passing Systems
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:20:44Z | |
| dc.date.available | 2004-05-31T22:20:44Z | |
| dc.date.created | 0000-01 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | This paper is concerned with the consequences for matrix computations of having a rather large number of general purpose processors, say ten or twenty thousand, connected in a network in such a way that a processor can communicate only with its immediate neighbors. Certain communication tasks associated with most matrix algorithms are defined and formulas developed for the time required to perform them under several communication regimes. The results are compared with the times for a nominal $n^3$ floating point operations. The results suggest that it is possible to use a large number of processors to solve matrix problems at a relatively fine granularity, provided fine grain communication is available. Additional figures are available at ftp thales.cs.umd.edu in the directory pub/reports (Also cross-referenced as UMIACS-TR-88-81) | en_US |
| dc.format.extent | 166851 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/541 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-2135 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-88-81 | en_US |
| dc.title | Communication and Matrix Computations on Large Message Passing Systems | en_US |
| dc.type | Technical Report | en_US |