Talk:Parallel algorithm: Difference between revisions
added headings to 2 earlier posts; deleted nonsensical post from 70.19.84.16 on 3 October 2006 |
|||
Line 1: | Line 1: | ||
{{WikiProject Computing|class=Start|importance=}} |
{{WikiProject Computing|class=Start|importance=}} |
||
{{WikiProject Computer science|class=Start|importance=low}} |
{{WikiProject Computer science|class=Start|importance=low}} |
||
== Parallel programming == |
|||
I typed in '/wiki/Parallel_programming' and got 'Parallel computing', but this is the page I wanted. |
I typed in '/wiki/Parallel_programming' and got 'Parallel computing', but this is the page I wanted. |
||
<span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:72.148.222.140|72.148.222.140]] ([[User talk:72.148.222.140|talk]] • [[Special:Contributions/72.148.222.140|contribs]]) 05:30, 14 March 2006</span><!-- Template:Unsigned2 --> |
|||
[[Category:[[Category:[[Category:[[Category:[[Category:]]]]]]]]]]#REDIRECT[[]] |
|||
== Embarrassingly parallel π algorithms == |
|||
There are entirely ("embarrassingly") parallel algorithms for computing digits of <math>\pi</math>. For example, see D. H. Bailey, P. B. Borwein and S. Plouffe, "On The Rapid Computation of Various Polylogarithmic Constants", manuscript, 1996, which is [http://citeseer.ist.psu.edu/bailey96rapid.html |
There are entirely ("embarrassingly") parallel algorithms for computing digits of <math>\pi</math>. For example, see D. H. Bailey, P. B. Borwein and S. Plouffe, "On The Rapid Computation of Various Polylogarithmic Constants", manuscript, 1996, which is [http://citeseer.ist.psu.edu/bailey96rapid.html |
Revision as of 11:46, 29 August 2009
![]() | Computing Start‑class | |||||||||
|
![]() | Computer science Start‑class Low‑importance | ||||||||||||||||
|
Parallel programming
I typed in '/wiki/Parallel_programming' and got 'Parallel computing', but this is the page I wanted. —Preceding unsigned comment added by 72.148.222.140 (talk • contribs) 05:30, 14 March 2006
Embarrassingly parallel π algorithms
There are entirely ("embarrassingly") parallel algorithms for computing digits of . For example, see D. H. Bailey, P. B. Borwein and S. Plouffe, "On The Rapid Computation of Various Polylogarithmic Constants", manuscript, 1996, which is [http://citeseer.ist.psu.edu/bailey96rapid.html available via Citeseer]. Also, just because an algorithm appears to have linear data dependencies doesn't mean that it can't be effectively parallelized. For details, see G. Blelloch, "Vector Models for Data-Parallel Computing." —Preceding unsigned comment added by Hilbertastronaut (talk • contribs) 16:53, 12 October 2007 (UTC)