| dc.contributor.advisor |
Charles Leiserson |
en_US |
| dc.contributor.author |
Agrawal, Kunal |
en_US |
| dc.contributor.author |
Lee, I-Ting Angelina |
en_US |
| dc.contributor.author |
Sukha, Jim |
en_US |
| dc.contributor.other |
Theory of Computation |
en_US |
| dc.date.accessioned |
2008-06-30T13:00:16Z |
|
| dc.date.available |
2008-06-30T13:00:16Z |
|
| dc.date.issued |
2008-02-20 and 2008-06-14 |
en_US |
| dc.identifier.other |
MIT-CSAIL-TR-2008-038 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/1721.1/41871 |
|
| dc.description.abstract |
Researchers in transactional memory (TM) have proposed open nesting asa methodology for increasing the concurrency of a program. The ideais to ignore certain "low-level" memory operations of anopen-nested transaction when detecting conflicts for its parenttransaction, and instead perform abstract concurrency control for the"high-level" operation that nested transaction represents. Tosupport this methodology, TM systems use an open-nested commitmechanism that commits all changes performed by an open-nestedtransaction directly to memory, thereby avoiding low-levelconflicts. Unfortunately, because the TM runtime is unaware of thedifferent levels of memory, an unconstrained use of open-nestedcommits can lead to anomalous program behavior.In this paper, we describe a framework of ownership-awaretransactional memory which incorporates the notion of modules into theTM system and requires that transactions and data be associated withspecific transactional modules or Xmodules. We propose a newownership-aware commit mechanism, a hybrid between anopen-nested and closed-nested commit which commits a piece of datadifferently depending on whether the current Xmodule owns the data ornot. Moreover, we give a set of precise constraints on interactionsand sharing of data among the Xmodules based on familiar notions ofabstraction. We prove that ownership-aware TM has has cleanmemory-level semantics and can guarantee serializability bymodules, which is an adaptation of multilevel serializability fromdatabases to TM. In addition, we describe how a programmer canspecify Xmodules and ownership in a Java-like language. Our typesystem can enforce most of the constraints required by ownership-awareTM statically, and can enforce the remaining constraints dynamically.Finally, we prove that if transactions in the process of aborting obeyrestrictions on their memory footprint, the OAT model is free fromsemantic deadlock. |
en_US |
| dc.description.provenance |
Submitted by CSAIL Importer (publications-dspace@csail.mit.edu) on 2008-06-30T13:00:14Z
No. of bitstreams: 2
MIT-CSAIL-TR-2008-038.pdf: 499108 bytes, checksum: 06fd3fb9a06bc71c2dce15547e2219ed (MD5)
MIT-CSAIL-TR-2008-038.ps: 73870 bytes, checksum: 3c111312917536c001d8d522207ebe36 (MD5) |
en |
| dc.description.provenance |
Made available in DSpace on 2008-06-30T13:00:16Z (GMT). No. of bitstreams: 2
MIT-CSAIL-TR-2008-038.pdf: 499108 bytes, checksum: 06fd3fb9a06bc71c2dce15547e2219ed (MD5)
MIT-CSAIL-TR-2008-038.ps: 73870 bytes, checksum: 3c111312917536c001d8d522207ebe36 (MD5)
Previous issue date: |
en |
| dc.format.extent |
36 p. |
en_US |
| dc.relation |
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
en_US |
| dc.relation |
|
en_US |
| dc.subject |
abstract serializability, open-nested transactions, ownership types, ownership-aware transactions, serializability by levels, serializability by modules, transactional memory, Xmodules |
en_US |
| dc.title |
Safe Open-Nested Transactions Through Ownership |
en_US |
