Sciweavers

4 search results - page 1 / 1
» On the Impossibility of Maximal Scheduling for Strong Fairne...
Sort
View
ICDCS
2009
IEEE
14 years 23 days ago
On the Impossibility of Maximal Scheduling for Strong Fairness with Interleaving
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...
Matthew Lang, Paolo A. G. Sivilotti
WDAG
2007
Springer
127views Algorithms» more  WDAG 2007»
13 years 9 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
MOBIHOC
2006
ACM
14 years 3 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
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...
Pablo Soldati, Björn Johansson, Mikael Johans...
INFOCOM
2003
IEEE
13 years 9 months ago
Uplink Scheduling in CDMA Packet-Data Systems
Abstract—Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the curre...
Krishnan Kumaran, Lijun Qian