92 search results - page 14 / 19 » Optimistic concurrency with OPTIK |
DC
2010
13 years 9 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
PPOPP
2012
ACM
12 years 5 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
COMPSAC
2005
IEEE
14 years 3 months ago
2005
IEEE
Parallel changes are a basic fact of modern software development. Where previously we looked at prima facie interference, here we investigate a less direct form that we call seman...
VCHCI
1993
14 years 1 months ago
1993
The interaction history of a document can be modelled as a tree of command objects. This model does not only support recovery (undo/redo), but is also suitable for cooperation betw...
WMRD
1992
14 years 1 months ago
1992
Ficus is a exible replication facility with optimistic concurrency control designed to span a wide range of scales and network environments. Support for partitioned operation is f...