Timeline for How to parallelize a sequential algorithm?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2011 at 21:45 | history | edited | kevin cline | CC BY-SA 3.0 |
Title spelling
|
| Dec 7, 2011 at 19:59 | answer | added | Tudor | timeline score: 7 | |
| Dec 7, 2011 at 19:23 | history | migrated | from stackoverflow.com (revisions) | ||
| Dec 7, 2011 at 19:22 | answer | added | ryaner | timeline score: 1 | |
| Dec 7, 2011 at 19:08 | comment | added | Jim Clay | Look for dependencies. Dependencies imply serialization. Non-dependencies imply parallelization. | |
| Dec 7, 2011 at 19:02 | comment | added | Andrew Rasmussen | Look for divide-and-conquer, or something like quick-sort where it breaks the problem in half recursively. In that case, every time it splits it in two, and each half isn't affected by the other half, you could parallalize there. | |
| Dec 7, 2011 at 18:58 | comment | added | David Thornley | This is a more general question, and better suited for programmers.se. | |
| Dec 7, 2011 at 18:53 | history | asked | Saurabh Saxena | CC BY-SA 3.0 |