… -thread latency, usually higher than 2× that of lock-based code [4]. The nature of … locks and
transactions: specifically, we may be able to leverage TM research to create a better locking …

… that spans the boundary between locks and transactions: specifically, we may be able …
locking mechanism. In this paper we propose one such mechanism, the Transactional Mutex Lock …

… more than it does transactions. For instance, the deadlock-freedom and composability
guarantees of transactions are not preserved, since our critical sections may execute in mutex lock …

… for concurrency between transactions. The locking mechanism of Transactional Mutex Locks
[4] which we study in this paper implements an optimistic locking scheme. These currently …

… mutex locks and Intel’s Restricted Transactional Memory have been compared and the behavior
of those transactions … ’s hardware transactional memory implementation of mutex locks. …

… We will refer to sync(v) 1 cl as a lock and permit any variable v to be used as a lock’s mutex.
… of locks and transactions, and importantly show that locks and transactions complement one …

… in the context of recoverable concurrent transactional memory [14, 39, … Transactional Mutex
Lock (dTML) algorithm [5], which is itself a durable extension of the Transactional Mutex Lock …

… lock. We believe these characteristics make TL2 a viable candidate for deployment of
transactional … In all benchmarks they are an order of magnitude faster than the single lock Mutex …

… as efficient (and easy to use) as conventional techniques based on mutual exclusion.
Transactional memory allows programmers … results show that transactional memory is competitive …

… lock-based constructs in luaproc, such as mutual exclusion (pthread_mutex_t) and condition
variables (pthread_cond_t), with transactional … avoid mixing locks and transactions, as we …