embarrassingly parallel
Language: English
Part of speech: adj
Pronunciation: ipa: /ɪmˌbæɹəsɪŋli ˈpæɹəlɛl/
ipa: /ɛm-/
ipa: /əmˈbɛɹəsɪŋli ˈpɛɹəˌlɛl/
ipa: /ɛm-/
Forms: form: more embarrassingly parallel
form: most embarrassingly parallel
Etymology: From embarrassingly (in the sense of being embarrassingly or extremely easy) + parallel.
Senses: examples: text: We call such applications "embarrassingly parallel" to emphasize the fact that, while there is a high degree of parallelism and it is possible to make efficient use of many processors, the granularity is large enough that no cooperation between the processors is required within the matrix computations.
ref: 1986, Cleve Moler, “Matrix Computation on Distributed Memory Multiprocessors”, in Michael T[homas] Heath, editor, Hypercube Multiprocessors 1986, Philadelphia, Pa.: Society for Industrial and Applied Mathematics, →ISBN, part IV (Numerical Computations), page 182:
text: In the product algorithm, in fact, only one arithmetic operation, a multiplication, is required, so with a sufficient number of processors it executes in constant time regardless of the degree of the result. […] This is the "embarrassingly parallel" aspect of the algorithms: doing this part in parallel is so trivial it's hardly worth mentioning.
ref: 1992, Dennis Weeks, “Embarrassingly Parallel Algorithms for Algebraic Number Arithmetic”, in Richard E. Zippel, editor, Computer Algebra and Parallelism: Second International Workshop, Ithaca, USA, May 9–11, 1990: Proceedings (Lecture Notes in Computer Science; 584), Berlin; Heidelberg, Baden-Württemberg: Springer-Verlag, →ISBN, page 63:
text: Both of the example applications we've looked at here would be considered embarrassingly parallel. […] By contrast, most parallel sorting algorithms require a great deal of interaction. For instance, consider merge sort, a common method of sorting numbers. It breaks the vector to be sorted into two (or more) independent parts, say the left half and right half, which are then sorted in parallel by two processes. So far, this is embarrassingly parallel, at least after the vector is divided in half. But then the two sorted halves must be merged to produce the sorted version of the original vector, and that process is not embarrassingly parallel.
ref: 2011, Norman Matloff, “Parallel R”, in The Art of R Programming: A Tour of Statistical Software Design, San Francisco, Calif.: No Starch Press, →ISBN, page 347:
text: We develop a parallel variational inference (VI) procedure for use in data-distributed settings, where each machine only has access to a subset of data and runs VI independently, without communicating with other machines. […] [W]e make use of the recently proposed nonparametric VI to facilitate an embarrassingly parallel VI procedure that can be applied to a wider scope of models, including to nonconjugate models. We derive our embarrassingly parallel VI algorithm, analyze our method theoretically, and demonstrate our method empirically on a few nonconjugate models.
ref: 2015 October 14, Willie Neiswanger, Chong Wang, Eric Xing, “Embarrassingly Parallel Variational Inference in Nonconjugate Models”, in arXiv, Ithaca, N.Y.: Cornell University, →DOI, →ISSN, →OCLC, abstract:
topics: computing
engineering
mathematics
natural-sciences
physical-sciences
programming
sciences
synonyms: delightfully parallel
embarrassingly parallelizable
perfectly parallel
pleasingly parallel
qualifier: parallel computing
glosses: Very easy to separate into a number of parallel tasks.
raw_tags: of a particular problem
Related terms: in parallel
massively parallel
parallelizable
parallelization