Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions

Avni, Hillel; Fatourou, Panagiota; Kosmas, Eleftherios

doi:10.1007/978-3-319-09581-3_3

Cited by 6 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, if the manual abort operation is never used within a given system, OptSVA-CF never causes any transaction to abort, meaning that such OptSVA-CF executions are indistinguishable from opaque [9] (as shown in [23], and by analogy to [3]). This extends the guarantees above to imply that a transaction never reads from an aborted transaction, and cascading aborts are avoided.…”

Section: Safetymentioning

confidence: 99%

“…Enter: distributed transactional memory (DTM) [4,13,6,17,18,25,3]. DTM is an approach modeled on database * The project was funded from National Science Centre funds granted by decision No.…”

Section: Introductionmentioning

confidence: 99%

“…Enter: distributed transactional memory (DTM) [4,13,6,17,18,25,3]. DTM is an approach modeled on database transactions and transactional memory known from (singlehost) multiprocessor systems [11,19].…”

Section: Introductionmentioning

confidence: 99%

“…Alternatively, they work on local copies and merge them with the original object only on a successful commit. Pessimistic concurrency control is a different approach, known in database transactions (e.g., two-phased locking) and brought to TM in [14,3] and our earlier work [27,28]. It involves transactions waiting until they have permission to access shared objects.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Atomic RMI: A Distributed Transactional Memory Framework

Siek

Wojciechowski

2015

Int J Parallel Prog

View full text Add to dashboard Cite

This paper presents Atomic RMI, a distributed transactional memory framework that supports the control flow model of execution. Atomic RMI extends Java RMI with distributed transactions that can run on many Java virtual machines located on different network nodes. Our system employs SVA, a fully-pessimistic concurrency control algorithm that provides exclusive access to shared objects and supports rollback and fault tolerance. SVA is capable of achieving a relatively high level of parallelism by interweaving transactions that access the same objects and by making transactions that do not share objects independent of one another. It also allows any operations within transactions, including irrevocable ones, like system calls, and provides an unobtrusive API. Our evaluation shows that in most cases Atomic RMI performs better than fine grained mutual-exclusion and read/write locking mechanisms. Atomic RMI also performs better than an optimistic transactional memory in environments with high contention and a high ratio of write operations, while being competitive otherwise.

show abstract

Section: Safetymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Atomic RMI: A Distributed Transactional Memory Framework

Siek

Wojciechowski

2015

Int J Parallel Prog

View full text Add to dashboard Cite

show abstract

“…A different approach, as suggested in [16,1,3] and our earlier work [30,31], is to use fully-pessimistic concurrency control [4,28]. This involves transactions waiting until they have permission to access shared objects.…”

Section: Introductionmentioning

confidence: 99%

The Optimal Pessimistic Transactional Memory Algorithm

Wojciechowski,

Siek

2016

Preprint

View full text Add to dashboard Cite

Transactional Memory (TM) is an approach aiming to simplify concurrent programming by automating synchronization while maintaining efficiency. TM usually employs the optimistic concurrency control approach, which relies on transactions aborting and restarting if conflicts occur. However, an aborted transaction can still leave some effects in the system that cannot be cleaned up, if irrevocable operations are present within its code. The pessimistic approach eliminates that problem, since it relies on deferring operations in case of conflict rather than aborting, but hitherto pessimistic TMs suffered from low parallelism due to the need of serializing transactions. In this paper, we aim to introduce OptSVA, a pessimistic TM concurrency control algorithm that ensures a high level of parallelism through a battery of far-reaching optimizations including early release, asynchronous execution, and the extensive use of buffering.

show abstract

Proactive Contention Avoidance

Avni

Kosmas

2015

Transactional Memory. Foundations, Algorithms, Tools, and Applications

View full text Add to dashboard Cite

Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions

Cited by 6 publications

References 23 publications

Atomic RMI: A Distributed Transactional Memory Framework

Atomic RMI: A Distributed Transactional Memory Framework

The Optimal Pessimistic Transactional Memory Algorithm

Proactive Contention Avoidance

Contact Info

Product

Resources

About