| 1 |
|
/* |
| 2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
| 3 |
|
* Expert Group and released to the public domain, as explained at |
| 4 |
< |
* http://creativecommons.org/licenses/publicdomain |
| 4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
|
|
| 15 |
|
* Threads. However, when applicable, they typically provide |
| 16 |
|
* significantly greater performance on multiprocessor platforms. |
| 17 |
|
* |
| 18 |
< |
* <p> Candidates for fork/join processing mainly include those that |
| 18 |
> |
* <p>Candidates for fork/join processing mainly include those that |
| 19 |
|
* can be expressed using parallel divide-and-conquer techniques: To |
| 20 |
|
* solve a problem, break it in two (or more) parts, and then solve |
| 21 |
|
* those parts in parallel, continuing on in this way until the |
