Embarrassingly parallel: Difference between revisions

Revision as of 18:45, 16 October 2024

Revision as of 18:47, 16 October 2024

Line 56:

==See also==

{{#invoke:sort list|asc|*[[Amdahl's law]] defines value ''[[Amdahl's law#Parallelization|P]]'', which would be almost or exactly equal to 1 for embarrassingly parallel problems.

*[[Cellular automaton]]

*[[Connection Machine]]

*[[CUDA|CUDA framework]]

*[[Manycore processor]]

*[[Map (parallel pattern)]]

*[[Multiprocessing]]

*[[Massively parallel]]

*[[Multiprocessing]]

*[[Parallel computing]]

*[[Process-oriented programming]]

*[[Shared-nothing architecture]] (SN)

*[[Symmetric multiprocessing]] (SMP)

*[[ConnectionVector Machineprocessor]]

*[[Cellular automaton]]

*[[CUDA|CUDA framework]]

*[[Manycore processor]]

*[[Vector processor]]}}

==References==

<references/>