6808 search results - page 275 / 1362 » Distributed Concurrency Control |
161
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
258
click to vote
PPOPP
2011
ACM
14 years 9 months ago
2011
ACM
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
177
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
211
click to vote
CONCUR
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
172
click to vote
DBSEC
2007
15 years 8 months ago
2007
Abstract. Despite the widespread adoption of Role-based Access Control (RBAC) models, new access control models are required for new applications for which RBAC may not be especial...