Transactions with isolation and cooperation

SmaragdakisYannis,; KayAnthony,; BehrendsReimer,; YoungMichal,

doi:10.1145/1297105.1297042

Cited by 17 publications

(22 citation statements)

References 51 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Communication and Visibility The TIC programming model [49] extends standard STM by allowing threads to observe the effects of other threads at selected points, thereby supporting operations that wait or perform irreversible actions inside transactional code. Lesani and Palsberg [38] describe a semantics that combines STM with message passing through tentative message passing, which keeps track of dependencies between transactions to enable undo of message passing in case a transaction aborts.…”

Section: Related Workmentioning

confidence: 99%

Turning nondeterminism into parallelism

Tripp

Koskinen

Sagiv

2013

Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages &Amp; Application

View full text Add to dashboard Cite

Nondeterminism is a useful and prevalent concept in the design and implementation of software systems. An important property of nondeterminism is its latent parallelism: A nondeterministic action can evaluate to multiple behaviors. If at least one of these behaviors does not conflict with concurrent tasks, then there is an admissible execution of the action in parallel with these tasks. Unfortunately, existing implementations of the atomic paradigm-optimistic as well as pessimistic-are unable to fully exhaust the parallelism potential of nondeterministic actions, lacking the means to guide concurrent tasks toward nondeterministic choices that minimize interference. This paper investigates the problem of utilizing parallelism due to nondeterminism. We observe that nondeterminism occurs in many real-world codes. We motivate the need for devising coordination mechanisms that can utilize available nondeterminism. We have developed a system featuring such mechanisms, which leverages nondeterminism in a wide class of query operations, allowing a task to look into the future of concurrent tasks that mutate the shared state during query evaluation and reduce conflict accordingly. We evaluate our system on a suite of 12 algorithmic benchmarks of wide applicability, as well as an industrial application. The results are encouraging.

show abstract

Section: Related Workmentioning

confidence: 99%

Turning nondeterminism into parallelism

Tripp

Koskinen

Sagiv

2013

Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages &Amp; Application

View full text Add to dashboard Cite

show abstract

“…One could release atomicity, effectively splitting a transaction in half (as in the punctuated transactions of Smaragdakis et al [36]), but this would break composability, and require the programmer to restore any global invariants before waiting on a condition. One could also limit conditions to the beginning of the transaction [15], but this does not compose.…”

Section: Condition Synchronization and Forward Progressmentioning

confidence: 99%

Transactions as the Foundation of a Memory Consistency Model

Dalessandro

Scott

Spear

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We argue for transactions as the synchronization primitive of an ordering-based memory consistency model. Rather than define transactions in terms of locks, our model defines locks, conditions, and atomic/volatile variables in terms of transactions. A traditional critical section, in particular, is a region of code, bracketed by transactions, in which certain data have been privatized. Our memory model, originally published at OPODIS'08, is based on the database notion of strict serializability (SS). In an explicit analogy to the DRF 0 of Adve and Hill, we demonstrate that SS provides the appearance of transactional sequential consistency (TSC) for programs that are transactional data-race free (TDRF).We argue against relaxation of the total order on transactions, but show that selective relaxation of the relationship between program order and transaction order (selective strict serializability-SSS) can allow the implementation of transaction-based locks to be as efficient as conventional locks. We also show that condition synchronization (in the form of the transactional retry primitive) can be accommodated in our model without explicit mention of speculation, opacity, or aborted transactions. Finally, we compare SS and SSS to the notion of strong isolation (SI), arguing that SI is neither sufficient for TSC nor necessary in programs that are TDRF.

show abstract

“…For instance, in the Mianjin language, type annotations distinguish routines that may perform communication [13]. More recently (independently from the AME work), the model Transactions with Isolation and Cooperation (TIC) includes a type system for atomicity [15]. In both Mianjin and TIC, the type systems are defined semiformally.…”

Section: Introductionmentioning

confidence: 99%

Automatic Mutual Exclusion and Atomicity Checks

Abadi

2008

Concurrency, Graphs and Models

View full text Add to dashboard Cite

Abstract. This paper provides an introduction to the Automatic Mutual Exclusion (AME) programming model and to its formal study, through the AME calculus. AME resembles cooperative multithreading; in the intended implementations, however, software transactional memory supports the concurrent execution of atomic fragments. This paper also studies simple dynamic and static mechanisms for atomicity checks in AME.

show abstract

Transactions with isolation and cooperation

Cited by 17 publications

References 51 publications

Turning nondeterminism into parallelism

Turning nondeterminism into parallelism

Transactions as the Foundation of a Memory Consistency Model

Automatic Mutual Exclusion and Atomicity Checks

Contact Info

Product

Resources

About