![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model
This paper provides a theoretical and practical framework for crash-resilient data structures on a machine with persistent (nonvolatile) memory but transient registers and cache. In contrast to certain prior w...
-
Chapter and Conference Paper
Generic Multiversion STM
Multiversion software transactional memory (STM) allows a transaction to read old values of a recently updated object, after which the transaction may serialize before transactions that committed earlier in physi...
-
Chapter and Conference Paper
Toward a Formal Semantic Framework for Deterministic Parallel Programming
Deterministic parallelism has become an increasingly attractive concept: a deterministic parallel program may be easier to construct, debug, understand, and maintain. However, there exist many different defini...
-
Chapter and Conference Paper
Fastpath Speculative Parallelization
We describe Fastpath, a system for speculative parallelization of sequential programs on conventional multicore processors. Our system distinguishes between the lead thread, which executes at almost-native speed,...
-
Chapter and Conference Paper
Transactions as the Foundation of a Memory Consistency Model
We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way around. A traditional critical se...
-
Chapter and Conference Paper
Ordering-Based Semantics for Software Transactional Memory
It has been widely suggested that memory transactions should behave as if they acquired and released a single global lock. Unfortunately, this behavior can be expensive to achieve, particularly when—as in the ...
-
Chapter and Conference Paper
Transaction Safe Nonblocking Data Structures
This brief announcement focuses on interoperability of software transactions with ad hoc nonblocking algorithms. Specifically, we modify arbitrary nonblocking operations so that (1) they can be used both insid...
-
Chapter and Conference Paper
Conflict Detection and Validation Strategies for Software Transactional Memory
In a software transactional memory (STM) system, conflict detection is the problem of determining when two transactions cannot both safely commit. Validation is the related problem of ensuring that a transaction ...
-
Chapter and Conference Paper
Preemption Adaptivity in Time-Published Queue-Based Spin Locks
The proliferation of multiprocessor servers and multithreaded applications has increased the demand for high-performance synchronization. Traditional scheduler-based locks incur the overhead of a full context ...
-
Chapter and Conference Paper
Adaptive Software Transactional Memory
Software Transactional Memory (STM) is a generic synchronization construct that enables automatic conversion of correct sequential objects into correct nonblocking concurrent objects. Recent STM systems, though s...
-
Chapter and Conference Paper
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-up, each with its own linearizat...
-
Chapter and Conference Paper
InterWeave: A Middleware System for Distributed Shared State
As an alternative to message passing, Rochester’s InterWeave sys- tem allows the programmer to map shared segments into programs spread across heterogeneous, distributed machines. InterWeave represents a merge...