Pages that link to "Item:Q1404305"
From MaRDI portal
The following pages link to Parallel complexity of matrix multiplication (Q1404305):
Displaying 16 items.
- Communication-efficient matrix multiplication on hypercubes (Q672105) (← links)
- Communication complexity of PRAMs (Q913504) (← links)
- Matrix-vector multiplication: Parallel algorithms and architectures (Q1114309) (← links)
- A balanced submatrix merging algorithm for multiprocessor architectures (Q1185909) (← links)
- How to express a parallel sum of \(k\) matrices (Q1598423) (← links)
- Scalable parallel matrix multiplication on distributed memory parallel computers (Q1604283) (← links)
- Parallel algorithms and architectures for matrix multiplication (Q1825597) (← links)
- Communication lower bounds for distributed-memory matrix multiplication (Q1886368) (← links)
- Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures (Q1903780) (← links)
- Automatic parallelization of cycles with two-dimensional arrays for distributed memory supercomputers (on the example of matrix multiplication) (Q2747658) (← links)
- To the role of decomposition strategy in high parallel algorithms (Q2776831) (← links)
- (Q4219043) (← links)
- (Q4238212) (← links)
- (Q4327513) (← links)
- Work-Preserving Speed-Up of Parallel Matrix Computations (Q4852625) (← links)
- Experimental evaluation of automatic array alignment in parallelized matlab (Q5943254) (← links)