|
|||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||
ABSTRACT
Transactional boosting is a methodology which improves transaction performance by using data-structure commutativity and abstract locks for synchronization. We announce a method for concurrent execution of non-commuting operations from distinct boosted transactions. Abstract locks are passed from one transaction to the next, and dependencies are created, enforcing certain commit orders. We summarize the approach and describe novel techniques for (i) performing recovery lazily and (ii) detecting cyclic dependencies. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
General Terms:
Keywords:
|
|||||||||||||||||||||||||||||||||||||