Sciweavers

472 search results - page 4 / 95
» Quick-release Fair Scheduling
Sort
View
ICDCS
2009
IEEE
14 years 4 months 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
WIOPT
2006
IEEE
14 years 1 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
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...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
CCGRID
2007
IEEE
14 years 1 months ago
Fair Game-Theoretic Resource Management in Dedicated Grids
We study two problems directly resulting from organizational decentralization of the Grid. Firstly, the problem of fair scheduling in systems in which the grid scheduler has compl...
Krzysztof Rzadca, Denis Trystram, Adam Wierzbicki
VTC
2008
IEEE
142views Communications» more  VTC 2008»
14 years 1 months ago
Fairness Assessment of the Adaptive Token Bank Fair Queuing Scheduling Algorithm
Abstract—Adaptive Token Bank Fair Queuing (ATBFQ) algorithm has been proposed as a cross-layer scheduling technique for 4G wireless systems recently. This algorithm takes higher ...
Feroz A. Bokhari, Halim Yanikomeroglu, William K. ...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 1 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel