Revision as of 16:04, 30 January 2019 edit Citation bot (talk \| contribs) Bots 5,861,935 edits m Alter: template type, isbn. Add: isbn, series, doi, pages, volume, journal. Removed parameters. Formatted dashes. \| You can use this bot yourself. Report bugs here. \| User-activated. ← Previous edit		Revision as of 03:41, 11 February 2019 edit undo Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 472,932 edits ce Next edit →
Line 17: ==Etymology== "Embarrassingly" is used here in the same sense as in the phrase "an [[embarrassment of riches]]", meaning an overabundance—here referring 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 also 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=Parallel Homotopy Algorithms to Solve Polynomial Systems\|year=2006\|journal=Proceedings of ICMS ~~2006~~\|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 = Matrix Computation on Distributed Memory Multiprocessors \| author = Moler, Cleve

Embarrassingly parallel: Difference between revisions