000125080 001__ 125080
000125080 005__ 20190316234307.0
000125080 037__ $$aREP_WORK
000125080 245__ $$aOn Obstruction-Free Transactions
000125080 269__ $$a2008
000125080 260__ $$c2008
000125080 336__ $$aReports
000125080 520__ $$aThis 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-access-parallelism (in a strict sense). This may result in artificial "hot spots" and thus limit the performance of OFTMs.
000125080 6531_ $$aTransactional memory
000125080 6531_ $$aobstruction-freedom
000125080 6531_ $$aconsensus number
000125080 6531_ $$aimpossibility
000125080 700__ $$0240335$$aGuerraoui, Rachid$$g105326
000125080 700__ $$aKapalka, Michal
000125080 8564_ $$s199297$$uhttps://infoscience.epfl.ch/record/125080/files/oftm-techreport08.pdf$$zn/a
000125080 909C0 $$0252114$$pDCL$$xU10407
000125080 909CO $$ooai:infoscience.tind.io:125080$$pIC$$preport$$qGLOBAL_SET
000125080 937__ $$aLPD-REPORT-2008-012
000125080 973__ $$aEPFL$$sPUBLISHED
000125080 980__ $$aREPORT