749 |
|
* each thread makes available for stealing enough tasks for |
750 |
|
* other threads to remain active. Inductively, if all threads |
751 |
|
* play by the same rules, each thread should make available |
752 |
< |
* only a constant number of tasks. |
752 |
> |
* only a constant number of tasks. |
753 |
|
* |
754 |
|
* The minimum useful constant is just 1. But using a value of |
755 |
|
* 1 would require immediate replenishment upon each steal to |
767 |
|
* hedge against uneven progress; as traded off against the |
768 |
|
* cost of extra task overhead. We leave the user to pick a |
769 |
|
* threshold value to compare with the results of this call to |
770 |
< |
* guide decisions, but recommend values such as 3. |
770 |
> |
* guide decisions, but recommend values such as 3. |
771 |
|
* |
772 |
|
* When all threads are active, it is on average OK to |
773 |
|
* estimate surplus strictly locally. In steady-state, if one |