Sciweavers

92 search results - page 12 / 19
» Optimistic concurrency with OPTIK
Sort
View
PODC
2010
ACM
15 years 3 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
114
Voted
CIDR
2011
252views Algorithms» more  CIDR 2011»
14 years 3 months ago
Hyder - A Transactional Record Manager for Shared Flash
Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool ...
Philip A. Bernstein, Colin W. Reid, Sudipto Das
IS
2002
14 years 11 months ago
Evaluation of concurrency control strategies for mixed soft real-time database systems
Previous research in real-time concurrency control mainly focuses on the schedulability guarantee of hard real-time transactions and the reducing of the miss rate of soft real-tim...
Kam-yiu Lam, Tei-Wei Kuo, Ben Kao, Tony S. H. Lee,...
SAC
2002
ACM
14 years 11 months ago
Concurrency control for distributed cooperative engineering applications
Distributed cooperative engineering applications require consistent and long-term sharing of large volumes of data, which may cause conflicts due to concurrent read/write operatio...
João Coelho Garcia, Paulo Ferreira
184
Voted
ICFP
2009
ACM
16 years 9 days ago
Parallel concurrent ML
Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite ...
John H. Reppy, Claudio V. Russo, Yingqi Xiao