Sciweavers

24 search results - page 4 / 5
» Tolerating Concurrency Bugs Using Transactions as Lifeguards
Sort
View
JSS
1998
87views more  JSS 1998»
13 years 5 months ago
On using similarity for concurrency control in real-time database systems
Most of the proposed concurrency control protocols for real-time database systems (RTDBS) are based on serializability theorem. Owing to the unique characteristics of real-time da...
Kam-yiu Lam, Wai-cheong Yau
HPCA
2008
IEEE
14 years 5 months ago
Thread-safe dynamic binary translation using transactional memory
Dynamic binary translation (DBT) is a runtime instrumentation technique commonly used to support profiling, optimization, secure execution, and bug detection tools for application...
JaeWoong Chung, Michael Dalton, Hari Kannan, Chris...
IEEEPACT
2006
IEEE
13 years 11 months ago
Testing implementations of transactional memory
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
Chaiyasit Manovit, Sudheendra Hangal, Hassan Chafi...
ADAEUROPE
2001
Springer
13 years 10 months ago
Transaction Support for Ada
This paper describes the transaction support framework OPTIMA and its implementation for Ada 95. First, a transaction model that fits concurrent programming languages is presented...
Jörg Kienzle, Ricardo Jiménez-Peris, A...
PPOPP
2010
ACM
14 years 2 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...