Sciweavers

92 search results - page 8 / 19
» Optimistic concurrency with OPTIK
Sort
View
DEXAW
2008
IEEE
129views Database» more  DEXAW 2008»
14 years 4 months ago
SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...
Zhaowen Xing, Le Gruenwald, K. K. Phang
CAV
2006
Springer
141views Hardware» more  CAV 2006»
14 years 1 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
IPPS
2009
IEEE
14 years 4 months ago
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially execute atomic blocks using STM with optimistic c...
Nehir Sönmez, Tim Harris, Adrián Crist...
ACMMSP
2006
ACM
278views Hardware» more  ACMMSP 2006»
14 years 3 months ago
Atomicity via source-to-source translation
We present an implementation and evaluation of atomicity (also known as software transactions) for a dialect of Java. Our implementation is fundamentally different from prior work...
Benjamin Hindman, Dan Grossman
ICDE
1999
IEEE
140views Database» more  ICDE 1999»
14 years 11 months ago
Multiversion Reconciliation for Mobile Databases
As mobile computing devices become more and more popular, mobile databases have started gaining popularity. An important feature of these database systems is their ability to allo...
Shirish Hemant Phatak, B. R. Badrinath