6808 search results - page 355 / 1362 » Distributed Concurrency Control |
205
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
146
click to vote
ICPADS
1997
IEEE
15 years 11 months ago
1997
IEEE
The number of concurrent users in VOD servers mainly depend on the disk placement strategies of video blocks. Especially, the storage server should make the most of MZR(multi-zone...
184
click to vote
ICPP
1994
IEEE
15 years 11 months ago
1994
IEEE
We assert that in order to perform well, a shared-memory multiprocessorinter-process communication (IPC)facility mustavoid a) accessing any shared data, and b) acquiring any locks...
255
click to vote
PODC
1993
ACM
15 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
129
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
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...