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