ACM Home Page
Please provide us with feedback. Feedback
Brief announcement: concurrent non-commutative boosted transactions
Full text PdfPdf (331 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the 28th ACM symposium on Principles of distributed computing table of contents
Calgary, AB, Canada
SESSION: B1-1 table of contents
Pages 272-273  
Year of Publication: 2009
ISBN:978-1-60558-396-9
Authors
Eric Koskinen  University of Cambridge, Cambridge, United Kingdom
Maurice Herlihy  Brown University, Providence, RI, USA
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 30,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1582716.1582760
What is a DOI?

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.

1
 
2
Broder, A., and Mitzenmacher, M. Network Applications of Bloom Filters: A Survey. Internet Mathematics 1, 4 (2004).
3
4
5
6

Collaborative Colleagues:
Eric Koskinen: colleagues
Maurice Herlihy: colleagues