✦ LIBER ✦

Parallel Complexity of Matrix Multiplication1

✍ Scribed by Eunice E. Santos

Book ID: 111538202
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 312 KB
Volume: 25
Category: Article
ISSN: 0920-8542
DOI: 10.1023/a:1023996628662

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity measures for matrix multiplic

Complexity measures for matrix multiplication algorithms

✍ F. Romani 📂 Article 📅 1980 🏛 Springer Milan 🌐 English ⚖ 367 KB

Parallel matrix multiplication on networ

Parallel matrix multiplication on networked microcomputers

✍ Çetin K. Koç; Seng C. Gan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Scalable Parallel Matrix Multiplication

Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers

✍ Keqin Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 392 KB

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

Parallel algorithms and architectures fo

Parallel algorithms and architectures for matrix multiplication

✍ C. Puglisi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Matrix-vector multiplication: Parallel a

Matrix-vector multiplication: Parallel algorithms and architectures

✍ B. Codenotti; C. Puglisi 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 346 KB

On the complexity of some algorithms of

On the complexity of some algorithms of matrix multiplication

✍ Valery B Alekseyev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 712 KB