Adaptive locks: Combining transactions and locks for efficient concurrency
نویسندگان
چکیده
منابع مشابه
Optimal Database Locks for Efficient Integrity Checking
In concurrent database systems, correctness of update transactions refers to the equivalent effects of the execution schedule and some serial schedule over the same set of transactions. Integrity constraints add further semantic requirements to the correctness of the database states reached upon the execution of update transactions. Several methods for efficient integrity checking and enforcing...
متن کاملTRINITY COLLEGE Shared Memory Concurrency and Fast, Biased Locks
Declaration I hereby declare that this project is entirely my own work and that it has not been submitted as an exercise for a degree at this or any other university. I agree that the Library and other agents of the College may lend or copy this thesis upon request. ____________________________ ___________ Jimmy Cleary Date 4 Acknowledgements I would like to thank my supervisor, Dr David Gregg,...
متن کاملReasoning about locks and transactions in concurrent programs
The aim of this thesis is to present novel techniques for reasoning about the dynamic and static semantics of concurrent programs that use locks and transactions to isolate accesses to shared memory. We use moverness to characterise the observational semantics of reads issued by locks and transactions under the simpler semantics of free, left, right and both movers. The second contribution is g...
متن کاملOptimizing the Concurrent Execution of Locks and Transactions
Transactional memory (TM) is a promising alternative to mutual exclusion. In spite of this, it may be unrealistic for TM programs to be devoid of locks due to their abundant use in legacy software systems. Consequently, for TMs to be practical they may need to manage the interaction of transactions and locks when they access the same shared-memory. This paper presents two algorithms, one coarse...
متن کاملTransactional Mutex Locks
Mutual exclusion (mutex) locks limit concurrency but offer low single-thread latency. Software transactional memory (STM) typically has much higher latency, but scales well. We present transactional mutex locks (TML), which attempt to achieve the best of both worlds for read-dominated workloads. We also propose compiler optimizations that reduce the latency of TML to within a small fraction of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2010
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2010.02.006