Embarrassingly parallel
Problem which is trivially divided into parallelized tasks
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.
Nº Q5369501 ★★
Uncommon · Knowledge
Embarrassingly parallel
Problem which is trivially divided into parallelized tasks
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Undecidable problem
Decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer
Nº Q3502995 ★
Parallel computing
Programming paradigm in which many calculations or the execution of processes are carried out simultaneously
Nº Q232661 ★★
Lump of labour fallacy
Misconception in economics about allocation of work
Nº Q2916947 ★★
Inverse problem
Process of calculating from a set of observations the causal factors that produced them, or deducing the causes or parameters that we cannot directly observe from their effects
Nº Q1567213 ★★
Wicked problem
Problem that is difficult or impossible to solve because of incomplete, contradictory, and changing requirements that are often difficult to recognize
Nº Q2891260 ★★
Multithreading (computer architecture)
Ability of a central processing unit (CPU) or a single core in a multi-core processor to execute multiple processes or threads concurrently
Nº Q1064412 ★★