34 search results - page 1 / 7 » A Distributed Maximal Scheduler for Strong Fairness |
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
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...
ICDCS
2009
IEEE
14 years 1 months ago
2009
IEEE
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
WIOPT
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
MOBIHOC
2006
ACM
14 years 4 months ago
2006
ACM
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
COORDINATION
2009
Springer
13 years 11 months ago
2009
Springer
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...