On Optimistic Methods For Concurrency Control

King, H.T.; Robinson, John T.

doi:10.1109/vldb.1979.718150

Cited by 121 publications

(143 citation statements)

References 12 publications

Supporting

Mentioning

142

Contrasting

Unclassified

Order By: Relevance

“…The ability to revert to a prior point within a concurrent execution is essential to transaction systems (Kung & Robinson 1981;Gray & Reuter 1993;Adya et al 1995); outside their role for database concurrency control, such approaches can improve parallel program performance by profitably exploiting speculative execution (Rinard 1999;Welc et al 2005). Harris et al (2005) proposes a transactional memory system for Haskell that introduces a retry primitive to allow a transactional execution to safely abort and be reexecuted, if desired resources are unavailable.…”

Section: Related Workmentioning

confidence: 99%

Lightweight checkpointing for concurrent ML

Ziarek

Jagannathan

2010

J. Funct. Prog.

View full text Add to dashboard Cite

Transient faults that arise in large-scale software systems can often be repaired by reexecuting the code in which they occur. Ascribing a meaningful semantics for safe reexecution in multithreaded code is not obvious, however. For a thread to reexecute correctly a region of code, it must ensure that all other threads that have witnessed its unwanted effects within that region are also reverted to a meaningful earlier state. If not done properly, data inconsistencies and other undesirable behavior might result. However, automatically determining what constitutes a consistent global checkpoint is not straightforward because thread interactions are a dynamic property of the program. In this paper, we present a safe and efficient checkpointing mechanism for Concurrent ML (CML) that can be used to recover from transient faults. We introduce a new linguistic abstraction, called stabilizers, that permits the specification of per-thread monitors and the restoration of globally consistent checkpoints. Safe global states are computed through lightweight monitoring of communication events among threads (e.g., message-passing operations or updates to shared variables). We present a formal characterization of its design, and provide a detailed description of its implementation within MLton, a whole-program optimizing compiler for Standard ML. Our experimental results on microbenchmarks as well as several realistic, multithreaded, server-style CML applications, including a web server and a windowing toolkit, show that the overheads to use stabilizers are small, and lead us to conclude that they are a viable mechanism for defining safe checkpoints in concurrent functional programs. 1

show abstract

Section: Related Workmentioning

confidence: 99%

Lightweight checkpointing for concurrent ML

Ziarek

Jagannathan

2010

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…Optimistic write: Our transactional memory writes optimistically [23]. The transaction boundaries are controlled by working on copies of the objects.…”

Section: Transactions At Runtimementioning

confidence: 99%

Transactional memory in a dynamic language

Renggli¹,

Nierstrasz²

2009

Computer Languages, Systems & Structures

View full text Add to dashboard Cite

“…In fact, we only hope that failures will rarely occur, whereas purely backup methods, making no use of locks, work hoping that conflicting accesses will rarely occur, and this is a more improbable condition. Kung and Robinson (1981), for example, suggest applying their approach to "query-dominant systems and very large tree-structured indexes" Among the locking methods, an approach towards efficiency improvement which we have already mentioned in the introduction is the semantic approach, such as, for example, that of Schwarz and Spector (1982). Locking is performed by making use of type-specific semantic knowledge about shared abstract types and operations in order to allow higher concurrency.…”

Section: Related Workmentioning

confidence: 99%