Revision as of 02:16, 1 April 2024 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,586 edits →Examples: example farm is big enough already; no need to search for more sources for the unsourced examples, just remove ← Previous edit		Revision as of 02:17, 1 April 2024 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,586 edits fix refs Next edit →
Line 17: ==Etymology== "Embarrassingly" is used here to refer to parallelization problems which are "embarrassingly easy".<ref>Matloff, Norman (2011). ''The Art of R Programming: A Tour of Statistical Software Design'', p.347. No Starch. {{ISBN\|9781593274108}}.</ref> The term may imply embarrassment on the part of developers or compilers: "Because so many important problems remain unsolved mainly due to their intrinsic computational complexity, it would be embarrassing not to develop parallel implementations of polynomial [[homotopy]] continuation methods."<ref>{{cite book\|last1=Leykin\|first1=Anton\|last2=Verschelde\|first2=Jan\|last3=Zhuang\|first3=Yan\|title=Mathematical Software - ICMS 2006 \|chapter=Parallel Homotopy Algorithms to Solve Polynomial Systems \|year=2006~~\|journal=Proceedings of ICMS~~ \|volume=4151\|pages=225–234\|doi=10.1007/11832225_22\|series=Lecture Notes in Computer Science\|isbn=978-3-540-38084-9}}</ref> The term is first found in the literature in a 1986 book on multiprocessors by [[MATLAB]]'s creator [[Cleve Moler]],<ref name=hcmp>{{cite book \| ~~title~~contribution = Matrix Computation on Distributed Memory Multiprocessors \| author = Moler, Cleve \| publisher = Society for Industrial and Applied Mathematics, Philadelphia \| ~~journal~~title = Hypercube Multiprocessors \| editor-last = Heath \| editor-first = Michael T.

Embarrassingly parallel: Difference between revisions