1204 search results - page 142 / 241 » Parallel concurrent ML |
136
Voted
ICPP
1994
IEEE
15 years 7 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...
119
Voted
IPPS
1994
IEEE
15 years 7 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
204
Voted
PODC
1993
ACM
15 years 7 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 ...
99
Voted
PODC
2010
ACM
15 years 7 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...
149
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...