196 |
|
* processing are common but not guaranteed. Operations involving |
197 |
|
* brief functions on small maps may execute more slowly than |
198 |
|
* sequential loops if the underlying work to parallelize the |
199 |
< |
* computation is more expensive than the computation |
200 |
< |
* itself. Similarly, parallelization may not lead to much actual |
201 |
< |
* parallelism if all processors are busy performing unrelated tasks. |
199 |
> |
* computation is more expensive than the computation itself. |
200 |
> |
* Similarly, parallelization may not lead to much actual parallelism |
201 |
> |
* if all processors are busy performing unrelated tasks. |
202 |
|
* |
203 |
|
* <p> All arguments to all task methods must be non-null. |
204 |
|
* |