Embarrassingly parallel

en.wikipedia.org · 1,358 words · saved by 4 readers

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 separate the problem into a number of parallel tasks. This is often the case where there is little or no dependency or need for communication between those parallel tasks, or for results between them.Thus, these are different from distributed computing problems that need communication between tasks, especially communication of intermediate results. They are easy to perform on server farms which lack the special infrastructure used in a true supercomputer cluster. They are thus well suited to large, Internet-based volunteer computing platforms such as BOINC, and do not suffer from parallel slowdown. The opposite of embarrassingly parallel problems are inherently serial problems, which cannot be parallelized at all.

Embarrassingly parallel - Wikipedia Jump to content From Wikipedia, the free encyclopedia Problem easily dividable into parallel 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

Embarrassingly parallel

saved by

related reading