78 search results - page 2 / 16 » Computable Obstructions to Wait-free Computability |
126
click to vote
PODC
1991
ACM
15 years 7 months ago
1991
ACM
d abstract) Maurice Herlihy Digital Equipment Corporation Cambridge Research Laboratory One Kendall Square Cambridge MA, 02139 Digital Equipment Corporation Cambridge Research Lab ...
124
Voted
PODC
1997
ACM
15 years 8 months ago
1997
ACM
Wait-free objects are often implemented through the use of a \helping scheme", whereby one process \helps" one or more other processes to complete an operation. This pap...
205
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 ...
114
Voted
SPAA
1990
ACM
15 years 7 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
118
Voted
EUROPAR
2006
Springer
15 years 7 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...