parallel slowdown

{{Short description|Phenomenon in parallel computing}}

{{More citations needed|date=March 2016}}

Image:Parallelization diagram.svg

Parallel slowdown is a phenomenon in parallel computing where parallelization of a parallel algorithm beyond a certain point causes the program to run slower (take more time to run to completion).{{cite web

| url = https://software.intel.com/en-us/blogs/2008/03/04/why-a-simple-test-can-get-parallel-slowdown

| title = Why a simple test can get parallel slowdown

| last = Kukanov

| first = Alexey

| date = 2008-03-04

| website =

| publisher =

| access-date = 2015-02-15

| quote =

}}

Parallel slowdown is typically the result of a communications bottleneck. As more processor 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 as embarrassingly parallel problems, do not require such communication, and thus are not affected by slowdown.

{{compsci-stub}}

{{Parallel computing}}