COMPUTER SCIENCE AND ENGINEERING
COMPUTER ARCHITECTURE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
What kind of partitioning is used in parallel matrix multiplication algorithms
|
|
checkerboard partitioning
|
|
|
no correct answer
|
|
|
striped partittioning
|
|
|
mixed, striped and checkerboard partitioning
|
Explanation:
Detailed explanation-1: -Recursive bisection approach: Partition data into two sets.
Detailed explanation-2: -Furthermore, three important criteria must be considered in order to determine the running time of a parallel algorithm; namely, (i) local computational tasks, (ii) the initial data layout, and (iii) the communication schedule.
Detailed explanation-3: -In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm for large matrices, with a better asymptotic complexity, although the naive algorithm is often better for smaller matrices.
There is 1 question to complete.