Content deleted Content added
m Dating maintenance tags: {{Citation needed}} |
Adding another synonym (ref: https://docs.microsoft.com/en-us/dotnet/standard/parallel-programming/understanding-speedup-in-plinq) |
||
Line 1:
In [[parallel computing]], an '''embarrassingly parallel''' workload or problem (also called '''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.<ref>{{cite book|last1=Herlihy|first1=Maurice|last2=Shavit|first2=Nir|title=The Art of Multiprocessor Programming, Revised Reprint|date=2012|publisher=Elsevier|isbn=9780123977953|page=14|edition=revised|url=https://books.google.com/books?id=vfvPrSz7R7QC&q=embarrasingly#v=onepage&q=embarrasingly&f=false|accessdate=28 February 2016|quote=Some computational problems are “embarrassingly parallel”: they can easily be divided into components that can be executed concurrently.}}</ref> 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.<ref name=dbpp>Section 1.4.4 of: {{cite book
|url=http://www.mcs.anl.gov/~itf/dbpp/text/node10.html
|title=Designing and Building Parallel Programs
| |||