Sciweavers

472 search results - page 44 / 95
» Quick-release Fair Scheduling
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
Sergey Gorinsky, Nageswara S. V. Rao
TWC
2008
117views more  TWC 2008»
13 years 8 months ago
Channel predictive proportional fair scheduling
There is growing interest in the area of cross-layer design. This paper addresses the problem of multi-user diversity scheduling together with channel prediction. Recent work demo...
Hans Jørgen Bang, Torbjörn Ekman, Davi...
TPDS
2008
92views more  TPDS 2008»
13 years 8 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu
CCGRID
2010
IEEE
13 years 10 months ago
A Fair Decentralized Scheduler for Bag-of-Tasks Applications on Desktop Grids
Desktop Grids have become very popular nowadays, with projects that include hundred of thousands computers. Desktop grid scheduling faces two challenges. First, the platform is vo...
Javier Celaya, Loris Marchal
SIGCOMM
1996
ACM
14 years 28 days ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng