Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N a ), where 2 < a [ 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N a /log N processors. Such a parallel
β¦ LIBER β¦
Parallel Algebraic Multigrid Methods on Distributed Memory Computers
β Scribed by Haase, Gundolf; Kuhn, Michael; Reitzinger, Stefan
- Book ID
- 118188126
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2002
- Tongue
- English
- Weight
- 296 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1064-8275
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Scalable Parallel Matrix Multiplication
β
Keqin Li
π
Article
π
2001
π
Elsevier Science
π
English
β 392 KB
Four-Index transformation on distributed
β
Lawrence A. Covick; Kenneth M. Sando
π
Article
π
1990
π
John Wiley and Sons
π
English
β 834 KB
Because it has 0(N5) operations, a low computation to data transfer ratio, and is a compact piece of code, the four-index transformation is a good test case for parallel algorithm development of electronic structure calculations. We present an algorithm primarily designed for distributed-memory mach
Evaluating recursive filters on distribu
β
StpiczyΕski, PrzemysΕaw
π
Article
π
2006
π
John Wiley and Sons
π
English
β 112 KB
A parallel-vector simplex algorithm on d
β
J. Qin; D. T. Nguyen
π
Article
π
1996
π
Springer-Verlag
π
English
β 271 KB
Parallel algorithms for bipartite matchi
β
Johannes Langguth; Md. Mostofa Ali Patwary; Fredrik Manne
π
Article
π
2011
π
Elsevier Science
π
English
β 614 KB
Parallel operation of CartaBlanca on sha
β
N. T. Padial-Collins; W. B. VanderHeyden; D. Z. Zhang; E. D. Dendy; D. Livescu
π
Article
π
2003
π
John Wiley and Sons
π
English
β 219 KB