 | This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Parallel slowdown" – news ·newspapers ·books ·scholar ·JSTOR(March 2016) (Learn how and when to remove this message) |
Parallel slowdown is a phenomenon inparallel computing where parallelization of aparallel algorithm beyond a certain point causes the program to run slower (take more time to run to completion).[1]
Parallel slowdown is typically the result of a communications bottleneck. As moreprocessor nodes are added, each processing node spends progressively more time doing communication than useful processing. At some point, the communications overhead created by adding another processing node surpasses the increased processing power that node provides, and parallel slowdown occurs.
Parallel slowdown occurs when the algorithm requires significant communication, particularly of intermediate results. Some problems, known asembarrassingly parallel problems, do not require such communication, and thus are not affected by slowdown.
 | Thiscomputer science article is astub. You can help Wikipedia byadding missing information. |
| General | |
|---|---|
| Levels | |
| Multithreading | |
| Theory | |
| Elements | |
| Coordination | |
| Programming | |
| Hardware | |
| APIs | |
| Problems | |
