Complexity of parallel matrix computations
نویسندگان
چکیده
منابع مشابه
Parallel Matrix Computations
In this article we develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, zve present algorithms that form the main module...
متن کاملExploiting Locality on Parallel Sparse Matrix Computations
By now, irregular problems are di cult to parallelize in an automatic way because of their lack of regularity in data access patterns. Most times, programmers must hand-write a particular solution for each problem separately. In this paper we present two pseudo-regular distributions which can be applied to partition most problems achieving very good average case distributions. Also, we have des...
متن کاملComputational Electromagnetics and Parallel Dense Matrix Computations
We present computational results using CORAL, a parallel, three-dimensional, nonlinear magnetostatic code based on a volume integral equation formulation. A key feature of CORAL is the ability to solve, in parallel, the large, dense systems of linear equations that are inherent in the use of integral equation methods. Using the Chameleon and PSLES libraries ensures portability and access to the...
متن کاملSparse Matrix Computations on Parallel Processor Arrays
We investigate the balancing of distributed compressed storage of large sparse matrices on a massively parallel computer. For fast computation of matrix{vector and matrix{matrix products on a rectangular processor array with e cient communications along its rows and columns we require that the nonzero elements of each matrix row or column be distributed among the processors located within the s...
متن کاملSparse Matrix Computations and their I/O Complexity
For many programs in high performance computing, but also in every day computational tasks, the performance bottleneck is caused by memory accesses instead of CPU time. To tackle this problem in a theoretical way, the I/O-model (external memory model) was introduced which models a fast internal memory (cache) of limited size where computations are performed, and an infinite external memory (dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90019-3