Timeline for Super-linear parallelism or speedup in parallel matrix multiplication algorithms
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2022 at 17:43 | comment | added | fulem | So, you say if input size is $n^2$, but "work" to do is $n^3$, then ideal speedup should be upper bounded by work? (the limit would be the case where the span is 1, because everything can be done in parallel). | |
| Jul 27, 2022 at 13:56 | history | answered | gnasher729 | CC BY-SA 4.0 |