Metraipolis › archive › dc_63dc8f5897e4

Embarrassingly parallel — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Embarrassingly_parallel
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:35:36.427Z
SHA-256 of the archived text
4ee937e5c08635f7c16e294300767c8c7ab9408005391c6229f26b71a82e083c
Stable URL of this page
https://metraipolis.com/documento/dc_63dc8f5897e4

How to cite

Embarrassingly parallel — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Embarrassingly_parallel (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_63dc8f5897e4 (Metraipolis archive dc_63dc8f5897e4, sha256 4ee937e5c08635f7c16e294300767c8c7ab9408005391c6229f26b71a82e083c)
BibTeX
@misc{dc63dc8f5897e4,
  title = {Embarrassingly parallel — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Embarrassingly_parallel},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_63dc8f5897e4; sha256 4ee937e5c08635f7c16e294300767c8c7ab9408005391c6229f26b71a82e083c},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Embarrassingly_parallel. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In parallel computing, an embarrassingly parallel workload or problem (also called embarrassingly parallelizable, perfectly parallel, delightfully parallel or pleasingly parallel) is one where little or no effort is needed to split the problem into a number of parallel tasks. This is due to minimal or no dependency upon communication between the parallel tasks, or for results between them. These differ from distributed computing problems, which need communication between tasks, especially communication of intermediate results. They are easier to perform on server farms which lack the special infrastructure used in a true supercomputer cluster. They are well-suited to large, Internet-based volunteer computing platforms such as BOINC, and suffer less from parallel slowdown. The opposite of embarrassingly parallel problems are inherently serial problems, which cannot be parallelized at all. A common example of an embarrassingly parallel problem is 3D video rendering handled by a graphics processing unit, where each frame (forward method) or pixel (ray tracing method) can be handled with no interdependency. Some forms of password cracking are another embarrassingly parallel task that is easily distributed on central processing units, CPU cores, or clusters.

Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «graphics processing unit»).
Fonte: Wikipedia in inglese, voce «Embarrassingly parallel» — https://en.wikipedia.org/wiki/Embarrassingly_parallel
Wikidata Q5369501: «problem which is trivially divided into parallelized tasks» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5369501
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Embarrassingly_parallel?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1338671164, consultata il 2026-10-05T23:12:31.422Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 7c9a1be7e6189172a2c5e7a8fef7932eb74ab759e6bd36c3c51b9b1c76b4aac4