Abstract
We introduce the design and implementation of dynamic separation (DS) as a programming discipline for using transactional memory. Our approach is based on the programmer indicating which objects can be updated in transactions, which can be updated outside transactions, and which are read-only. We introduce explicit operations that identify transitions between these modes of access. We show how to guarantee strong semantics for programs that use these DS operations correctly, even over an STM implementation that provides only weak atomicity. We describe a run-time checking tool (analogous to a data-race detector) that can test whether or not a program is using DS operations correctly. We also examine the use of DS in an asynchronous IO library. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Abadi, M., Birrell, A., Harris, T., Hsieh, J., & Isard, M. (2009). Implementation and use of transactional memory with dynamic separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5501 LNCS, pp. 63–77). https://doi.org/10.1007/978-3-642-00722-4_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
