| 摘要 |
A lock management technique that combines low-space overhead via sharing of lock states of equal value with comprehensive support for bulk delegation of locks has been developed. Operating in conjunction with methods for validating delegation requests prior to their execution, bulk delegation of locks can be achieved with computational costs that are generally independent of the number of lock being delegated. This property, added to the low-space overhead representation of locks via lock state sharing, offer a combination that may be particularly attractive for systems that demand for fine-granularity locking, large transaction sizes (in term of number of locks acquired) and efficient bulk delegation mechanisms.
|
