Sciweavers

92 search results - page 5 / 19
» Optimistic concurrency with OPTIK
Sort
View
WDAG
2004
Springer
134views Algorithms» more  WDAG 2004»
14 years 3 months ago
An Optimistic Approach to Lock-Free FIFO Queues
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
Edya Ladan-Mozes, Nir Shavit
RTCSA
1999
IEEE
14 years 1 months ago
Dynamic Adjustment of Serialization Order Using Timestamp Intervals in Real-Time Databases
Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy re...
Jan Lindström, Kimmo E. E. Raatikainen
DEXAW
2002
IEEE
79views Database» more  DEXAW 2002»
14 years 2 months ago
Understanding the Behavior of the Conflict-Rate Metric in Optimistic Peer Replication
Optimistic replication of data is a widely used tool for mobile environments, but the behavior of concurrent conflicting updates caused by the relaxed consistency model is poorly ...
An-I Wang, Peter L. Reiher, Rajive Bagrodia, Geoff...
WETICE
1998
IEEE
14 years 1 months ago
User Controlled Sharing in a Variable Connected Distributed System
This paper describes the design and implementation of a distributed file repository that supports data sharing in a variable connected environment. Our design is based on the obse...
Tage Stabell-Kulø, Terje Fallmyr
JOT
2007
89views more  JOT 2007»
13 years 9 months ago
Graph-based Optimistic Transaction Management
In this paper, we introduce and describe directed dependency graph-based transaction and concurrency control (DCC) for persistent (stable, single-level) object-based bulk data man...
Frans A. Henskens, Maurice G. Ashton