473 search results - page 24 / 95 » Early-release fair scheduling |
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re...
ICPADS
2006
IEEE
14 years 3 months ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
CCGRID
2010
IEEE
13 years 10 months ago
2010
IEEE
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...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
SIGCOMM
1996
ACM
14 years 1 months ago
1996
ACM
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...