6 search results - page 1 / 2 » Unlocking concurrency |
PODC
2010
ACM
13 years 11 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
QUEUE
2006
13 years 7 months ago
2006
ADC
2000
Springer
14 years 4 days ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
PODC
2010
ACM
13 years 11 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...
MASCOTS
2010
13 years 9 months ago
2010
The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technolog...