Parallel computing, a problem which is able to be 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.[1] This is due to minimal or no dependency upon communication between the parallel tasks, or for results between them.[2]
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.[3] Some forms of password cracking are another embarrassingly parallel task that is easily distributed on central processing units, CPU cores, or clusters.
^Herlihy, Maurice; Shavit, Nir (2012). The Art of Multiprocessor Programming, Revised Reprint (revised ed.). Elsevier. p. 14. ISBN 9780123977953. Retrieved 28 February 2016. Some computational problems are "embarrassingly parallel": they can easily be divided into components that can be executed concurrently.
^Section 1.4.4 of: Foster, Ian (1995). Designing and Building Parallel Programs. Addison–Wesley. ISBN 9780201575941. Archived from the original on 2011-03-01.
^Alan Chalmers; Erik Reinhard; Tim Davis (21 March 2011). Practical Parallel Rendering. CRC Press. ISBN 978-1-4398-6380-0.
and 26 Related for: Embarrassingly parallel information
In parallel computing, an embarrassinglyparallel workload or problem (also called embarrassingly parallelizable, perfectly parallel, delightfully parallel...
embarrassing parallelism if they rarely or never have to communicate. Embarrassinglyparallel applications are considered the easiest to parallelize....
the processing of very large amounts of data in parallel. Multiprocessing EmbarrassinglyparallelParallel computing Process-oriented programming Shared-nothing...
be useful for non-graphic calculations involving embarrassinglyparallel problems due to their parallel structure. Other non-graphical uses include the...
particularly of intermediate results. Some problems, known as embarrassinglyparallel problems, do not require such communication, and thus are not affected...
that parallel rendering can be applied to mobile gaming to decrease power consumption and increase graphical fidelity. Rendering is an embarrassingly parallel...
are easy to divide up into pieces in this way – these are called embarrassinglyparallel problems. Examples include many algorithms to solve Rubik's Cubes...
both embarrassinglyparallel, and in fact the third stage does not depend on the results of the first two stages, so it may be done in parallel with them...
in 3D. The algorithm is embarrassinglyparallel, because all cells are processed independently. It is easy to write a parallel algorithm assuming: Shared...
tasks. Grid computing has been applied to a number of large-scale embarrassinglyparallel problems that require supercomputing performance scales. However...
within polynomial time. Some parallel approaches, such as Collaborative Diffusion, are based on embarrassinglyparallel algorithms spreading multi-agent...
he also worked for Intel Hypercube, where he coined the term "embarrassinglyparallel", and Ardent Computer Corporation. He is also co-author of four...
and cryptography applications, as well as with other so-called "embarrassinglyparallel" tasks. Software refers to parts of the computer which do not have...
problems, the embarrassinglyparallel nature of the algorithm allows this large cost to be reduced (perhaps to a feasible level) through parallel computing...
complex learning, planning, and decision-making problems. It is embarrassinglyparallel, thus able to exploit large scale computation and spatial distribution...
different computers, in order to increase the overall throughput. Embarrassinglyparallel problems are highly amenable to this approach.[citation needed]...
only supported parallel computing, but also shared file systems and peripheral devices. The idea was to provide the advantages of parallel processing, while...
mathematical basis of neural networks and image manipulation are similar, embarrassinglyparallel tasks involving matrices, leading GPUs to become increasingly used...
being split up into numerous smaller applications, so-called "embarrassinglyparallel problems". Frequently, a computational problem that can be solved...
advantage of this technique is that the search for relations is embarrassinglyparallel; a large number of computers can be set to work searching different...
applications, distributed or grid computing can be seen as a special type of parallel computing that relies on complete computers (with onboard CPUs, storage...
NAS Parallel Benchmarks (NPB) are a set of benchmarks targeting performance evaluation of highly parallel supercomputers. They are developed and maintained...
systems (unless the software is embarrassinglyparallel). In our example above, the second "i" loop is embarrassinglyparallel, but in the first loop each...
be made small enough to be portable. Building the index is an embarrassinglyparallel problem, and so the work can be accelerated greatly e.g. by renting...
Global Information