Filters








8,806 Hits in 6.8 sec

Why Transactional Memory Should Not Be Obstruction-Free [article]

Petr Kuznetsov, Srivatsan Ravi
2016 arXiv   pre-print
Early TM designs avoided using locks and relied on non-blocking synchronization to ensure obstruction-freedom: a transaction that encounters no step contention is not allowed to abort.  ...  Transactional memory (TM) is an inherently optimistic abstraction: it allows concurrent processes to execute sequences of shared-data accesses (transactions) speculatively, with an option of aborting them  ...  Indeed, obstructions TMs like DSTM [20] and FSTM [13] satisfy weak DAP, but not read invisibility since read operations must write to the shared memory.  ... 
arXiv:1502.02725v2 fatcat:33mjdkvemnai5mj2qfansll3ma

Concurrent programming without locks

Keir Fraser, Tim Harris
2007 ACM Transactions on Computer Systems  
The second API is a word-based software transactional memory (WSTM) which can allow sequential code to be reused more directly than with MCAS and which provides better scalability when locations are being  ...  The third API is an object-based software transactional memory (OSTM). OSTM allows a simpler implementation than WSTM, but at the cost of reengineering the code to use OSTM objects.  ...  Implementations of our APIs should not introduce contention in the sets of memory locations they access: Operations which access disjoint parts of a data structure should be able to execute in parallel  ... 
doi:10.1145/1233307.1233309 fatcat:u2fl7u7lxrfndp6qduitxy5sbq

Advanced contention management for dynamic software transactional memory

William N. Scherer, Michael L. Scott
2005 Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '05  
The obstruction-free Dynamic Software Transactional Memory (DSTM) system of Herlihy et al. allows only one transaction at a time to acquire an object for writing.  ...  Should a second require an object currently in use, a contention manager must determine which may proceed and which must wait or abort.  ...  Any obstruction-free algorithm can be augmented with a variety of contention management policies.  ... 
doi:10.1145/1073814.1073861 dblp:conf/podc/SchererS05 fatcat:255gkuyekbff5bq5suimfmd5pm

The Transactional Memory

V. M. Dhivya Shri, K. Reshma
2019 International Journal of Scientific Research in Computer Science Engineering and Information Technology  
Transactional memory (TM) promises to simplify concurrent programming. Language-based constructs allow programmers to denote atomic regions declaratively.  ...  TM allows programmers to write simpler programs that are composable and deadlock-freeThis essay presents remarkable similarities between transactional Memory and garbage collection.  ...  If the reasons are shallow or marginal, then transactional memory should probably just be a current fad, as some critics think it is.  ... 
doi:10.32628/cseit1951117 fatcat:ob62ayqwtjaa7i5ymz7jxzthja

Obstruction-Free Algorithms Can Be Practically Wait-Free [chapter]

Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
2005 Lecture Notes in Computer Science  
We present a transformation that converts any obstruction-free algorithm into one that is wait-free when analyzed in the unknown-bound semisynchronous model.  ...  The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations that are faster in the uncontended  ...  Recently Herlihy, Luchangco, Moir and Scherer [18] introduced a dynamic software transactional memory (DSTM) package, which allows programmers to develop obstruction-free data structures without reasoning  ... 
doi:10.1007/11561927_8 fatcat:fdzoxthmwfcqvlzppvy3kzneka

The transactional memory / garbage collection analogy

Dan Grossman
2007 SIGPLAN notices  
This essay presents remarkable similarities between transactional memory and garbage collection.  ...  The author's research on transactional memory has been generously supported by Intel Corporation, Microsoft Corporation, and the University of Washington Royalty Research Fund.  ...  Some implementations of transactional memory do not make obstruction-freedom guarantees.  ... 
doi:10.1145/1297105.1297080 fatcat:mcgkbnpue5gzjav52fvier6qqm

The transactional memory / garbage collection analogy

Dan Grossman
2007 Proceedings of the 22nd annual ACM SIGPLAN conference on Object oriented programming systems and applications - OOPSLA '07  
This essay presents remarkable similarities between transactional memory and garbage collection.  ...  The author's research on transactional memory has been generously supported by Intel Corporation, Microsoft Corporation, and the University of Washington Royalty Research Fund.  ...  Some implementations of transactional memory do not make obstruction-freedom guarantees.  ... 
doi:10.1145/1297027.1297080 dblp:conf/oopsla/Grossman07 fatcat:lev6ytg45zchzabv3pprp2xxga

On the Nature of Progress [chapter]

Maurice Herlihy, Nir Shavit
2011 Lecture Notes in Computer Science  
It also explains why the wait-free property is a natural basis for the consensus hierarchy: a theory of shared-memory computation requires an independent progress condition, not one that makes demands  ...  such as obstruction-freedom, lock-freedom, and wait-freedom.  ...  (For example, consider lock-free, obstruction-free, and lock-based software transactional memory systems [13] ).  ... 
doi:10.1007/978-3-642-25873-2_22 fatcat:ymy4y473hffzvbjmcaoikvnkgi

Model checking transactional memories

Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
2009 Distributed computing  
Model checking transactional memories (TMs) is difficult because of the unbounded number, length, and delay of concurrent transactions, as well as the unbounded size of the memory.  ...  This paper is an extended and revised version of our previous work on model checking transactional memories [11, 12] .  ...  Proof Let M be a TM that ensures (2, 1) obstruction freedom but not (n, k) obstruction freedom for some arbitrary n and k. Let w ∈ M be a word such that w is not obstruction free.  ... 
doi:10.1007/s00446-009-0092-6 fatcat:dpgnd7e4qvdh5cy3khzwuwi53e

Model checking transactional memories

Rachid Guerraoui, Thomas A. Henzinger, Barbara Jobstmann, Vasu Singh
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
Model checking transactional memories (TMs) is difficult because of the unbounded number, length, and delay of concurrent transactions, as well as the unbounded size of the memory.  ...  This paper is an extended and revised version of our previous work on model checking transactional memories [11, 12] .  ...  Proof Let M be a TM that ensures (2, 1) obstruction freedom but not (n, k) obstruction freedom for some arbitrary n and k. Let w ∈ M be a word such that w is not obstruction free.  ... 
doi:10.1145/1375581.1375626 dblp:conf/pldi/GuerraouiHJS08 fatcat:6vxcahon3bgfhdeygvsxjocabu

Transactional memory

Håkan Grahn
2010 Journal of Parallel and Distributed Computing  
the state-of-the-art in transactional memory research.  ...  This special issue on transactional memory introduces transactional memory as a concept, presents an overview of some of the most important approaches so far, and finally, includes five articles that advances  ...  Weak ASTM [61, 62] Non-blocking (obstruction-free) Optimistic Object Deferred Early or Late Contention manager Not sup- ported Weak RSTM [63] Non-blocking (obstruction-free)  ... 
doi:10.1016/j.jpdc.2010.06.006 fatcat:s3qswzin6jhoneph7taqsnxoxe

Distributed Computing Column 58

Jennifer L. Welch
2015 ACM SIGACT News  
Most of all, my thanks and admiration to Maurice Herlihy for his seminal contributions, not only to transactional memory, but to nonblocking algorithms, topological analysis, and so many other aspects  ...  References Concluding Thoughts While the discussion above spans much of the history of transactional memory, and mentions many open questions, the coverage has of necessity been spotty, and the choice  ...  Obstruction-free synchronization: Double-ended queues as an example.  ... 
doi:10.1145/2789149.2789163 fatcat:ueub5knoofar3jee6plc763yni

Real-Time Support for Software Transactional Memory

Toufik Sarni, Audrey Queudet, Patrick Valduriez
2009 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications  
However, up to now, the scheduling of real-time transactions within software transactional memories has not been studied.  ...  To address this issue, we present in this paper a real-time software transactional memory, namely RT-STM. We focus on the scheduling of concurrent soft real-time transactions.  ...  In real-time database systems, not only database consistency should be satisfied, but transactions must also meet their deadlines [24] .  ... 
doi:10.1109/rtcsa.2009.57 dblp:conf/rtcsa/SarniQV09 fatcat:tlolhkni35eufms5sfksuu2ntm

RobuSTM: A Robust Software Transactional Memory [chapter]

Jons-Tobias Wamhoff, Torvald Riegel, Christof Fetzer, Pascal Felber
2010 Lecture Notes in Computer Science  
For software transactional memory (STM) to be usable in large applications such as databases, it needs to be robust, i.e., live, efficient, tolerant of crashed and non-terminating transactions, and practical  ...  We show how to implement a robust software transactional memory (RobuSTM) in MSM.  ...  [7] proposed an algorithm that converts any obstruction-free algorithm [11] into a practically wait-free one.  ... 
doi:10.1007/978-3-642-16023-3_32 fatcat:evqrenmfsvbgfcklwkmjdgmmna

On the Cost of Concurrency in Transactional Memory [chapter]

Petr Kuznetsov, Srivatsan Ravi
2011 Lecture Notes in Computer Science  
implementation described in Algorithm 7.2 overcomes the linear per-read instrumentation cost by allowing hardware readers to abort due to a concurrent software writer, but maintains progressiveness for software transactions  ...  Why Transactional memory should not be obstruction-free Instead, early TM designs relied on non-blocking synchronization, where a prematurely halted transaction cannot prevent all other transactions from  ...  Recall that there exists an edge between t-objects X and Y in G(T i , T j , E) only if there exists a transaction T ∈ txns(E) such that {X, Y } ∈ Dset(T ). 5.6 Why Transactional memory should not be  ... 
doi:10.1007/978-3-642-25873-2_9 fatcat:7ehtxssf45abzc2bnigccm6evq
« Previous Showing results 1 — 15 out of 8,806 results