Revision 6e4f6dfa doc/design-2.0-locking.rst
b/doc/design-2.0-locking.rst | ||
---|---|---|
155 | 155 |
- Try to acquire one of these lock sets and return the first one you were |
156 | 156 |
able to get (or after a timeout) (select/poll like) |
157 | 157 |
|
158 |
Keep in mind, though, that any operation using the first operation, or setting |
|
159 |
a timeout for the second one, is susceptible to starvation and thus may never |
|
160 |
be able to get the required locks and succeed. Considering this providing/using |
|
161 |
these operations should not be among our first priorities |
|
158 |
These operations can be used to prioritize operations based on available locks, |
|
159 |
rather than making them just blindly queue for acquiring them. The inherent |
|
160 |
risk, though, is that any code using the first operation, or setting a timeout |
|
161 |
for the second one, is susceptible to starvation and thus may never be able to |
|
162 |
get the required locks and complete certain tasks. Considering this |
|
163 |
providing/using these operations should not be among our first priorities. |
|
162 | 164 |
|
163 | 165 |
Locking granularity |
164 | 166 |
~~~~~~~~~~~~~~~~~~~ |
Also available in: Unified diff