Download:
|
by Michael Merritt, Gadi Taubenfeld
http://www-sor.inria.fr/mirrors/disc98/postscripts/14990305.ps
Add To MetaCart
Abstract:
Abstract. Fairness in concurrent systems can be viewed as an abstraction that bridges low-level timing guarantees and make them available to programmers with a minimal loss of power and a maximal ease of use. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems.
Citations
|
1073
|
Impossibility of distributed consensus with one faulty process
– Fischer, Lynch, et al.
- 1985
|
|
498
|
Wait-Free Synchronization
– Herlihy
- 1991
|
|
310
|
Consensus in the presence of partial synchrony
– Dwork, Lynch, et al.
- 1988
|
|
179
|
A Fast Mutual Exclusion Algorithm
– Lamport
- 1983
|
|
127
|
Memory Requirements for Agreement Among Unreliable Asynchronous Processes
– Loui, Abu-Amara
- 1987
|
|
47
|
The mutual exclusion problem—part i: A theory of interprocess communication
– Lamport
- 1985
|
|
42
|
Bounds on the time to reach agreement in the presence of timing uncertainity
– Attiya, Dwork, et al.
- 1991
|
|
27
|
Time-adaptive Algorithms for Synchronization
– Alur, Attiya, et al.
- 1997
|
|
26
|
On the space complexity of randomized synchronization
– Fich, Herlihy, et al.
- 1998
|
|
23
|
Real-Time Object Sharing with Minimal System Support
– RAMAMURTHY, MOIR, et al.
- 1996
|
|
19
|
Early Detection of Message Forwarding Faults
– Herzberg, Kutten
- 1989
|
|
19
|
Timing-based Mutual Exclusion
– Lynch, Shavit
- 1992
|
|
13
|
Fast Timing-based Algorithms
– Alur, Taubenfeld
- 1996
|
|
13
|
Distributed elections in an archimedean ring of processors
– Vitanyi
- 1984
|
|
11
|
How to share an object: A fast timing-based solution
– Alur, Taubenfeld
- 1993
|
|
10
|
Finitary fairness
– Alur, Henzinger
- 1994
|
|
8
|
Closed schedulers: A novel technique for analyzing asynchronous protocols
– Lubitch, Moran
- 1995
|
|
6
|
Time bounds for decision problems in the presence of timing uncertainty and failures
– Attiya, Djerassi-Shintel
- 1993
|
|
5
|
Bounds on shared-memory for mutual exclusion
– Burns, Lynch
- 1993
|
|
3
|
An efficient solution to the mutual exclusion problem using weak semaphores
– Friedberg, Peterson
- 1987
|
|
3
|
Bounded fairness
– Jayasimha, Dershowitz
- 1986
|
|
3
|
New bounds on mutual exclusion problems
– PETERSON
- 1980
|
|
3
|
Efficient distributed algorithms by using the Archimedean time assumption
– Spirakis, Tampakas
- 1988
|
|
1
|
Wait-freeom vs. bounded wait-freeom in public data structures
– Brit, Moran
- 1994
|
