5562 search results - page 1006 / 1113 » Implementing Parallel Cell-DEVS |
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
98
Voted
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
99
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
109
Voted
TCC
2009
Springer
16 years 3 months ago
2009
Springer
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
124
click to vote
HPCA
2001
IEEE
16 years 2 months ago
2001
IEEE
Mispredicted branches and loads that miss in the cache cause the majority of retirement stalls experienced by sequential processors; we call these critical instructions. Despite t...