This paper studies obstruction-free software transactional memory systems (OFTMs). These systems are appealing, for they combine the atomicity property of transactions with a liveness property that ensures the commitment of every transaction that eventually encounters no contention. We precisely define OFTMs and establish two of their fundamental properties. First, we prove that the consensus number of such systems is 2. This indicates that OFTMs cannot be implemented with plain read/write shared memory, on the one hand, but, on the other hand, do not require powerful universal objects, such as compare-and-swap. Second, we prove that OFTMs cannot ensure disjoint-accessparallelism (in a strict sense). This may result in artificial "hot spots" and thus limit the performance of OFTMs.
Guerraoui and Kapalka REF prove that obstruction-free implementations of software transactional memory cannot ensure strict disjoint-access parallelism.
On obstruction-free transactions
SPAA '08
Computer Science