Sciweavers

ACTA
2011
12 years 11 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
13 years 8 months ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao
IFM
2005
Springer
13 years 10 months ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert
WDAG
2007
Springer
127views Algorithms» more  WDAG 2007»
13 years 10 months ago
A Distributed Maximal Scheduler for Strong Fairness
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
Matthew Lang, Paolo A. G. Sivilotti