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 matrix multiplication on networked microcomputers
✍ Scribed by Çetin K. Koç; Seng C. Gan
- Book ID
- 113211951
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 554 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0045-7906
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Scalable Parallel Matrix Multiplication
✍
Keqin Li
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 392 KB
Parallel Complexity of Matrix Multiplica
✍
Eunice E. Santos
📂
Article
📅
2003
🏛
Springer US
🌐
English
⚖ 312 KB
Matrix multiplication by diagonals on a
✍
Niel K. Madsen; Garry H. Rodrigue; Jack I. Karush
📂
Article
📅
1976
🏛
Elsevier Science
🌐
English
⚖ 633 KB
Load-Balanced Sparse Matrix–Vector Multi
✍
Sorin G. Nastea; Ophir Frieder; Tarek El-Ghazawi
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 560 KB
We considered the load-balanced multiplication of a large sparse matrix with a large sequence of vectors on parallel computers. We propose a method that combines fast load-balancing with efficient message-passing techniques to alleviate computational and inter-node communications challenges. The per
Parallel algorithms and architectures fo
✍
C. Puglisi
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 648 KB
Matrix-vector multiplication: Parallel a
✍
B. Codenotti; C. Puglisi
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 346 KB