Sciweavers

77 search results - page 4 / 16
» Divisible load scheduling with improved asymptotic optimalit...
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
FGCS
2006
82views more  FGCS 2006»
13 years 7 months ago
PGGA: A predictable and grouped genetic algorithm for job scheduling
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
Maozhen Li, Bin Yu, Man Qi
PE
2010
Springer
137views Optimization» more  PE 2010»
13 years 6 months ago
Tail-robust scheduling via limited processor sharing
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
Jayakrishnan Nair, Adam Wierman, Bert Zwart
HPCN
1998
Springer
13 years 11 months ago
Scheduling Strategy to improve Response Time for Web Applications
We propose a tunable scheduling strategy that lies between FIFO and shortest- rst, based on the value of a coe cient Alpha. If Alpha is set to zero then this strategy is just FIFO....
Ludmila Cherkasova
STACS
1995
Springer
13 years 11 months ago
Optimal Average Case Sorting on Arrays
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, ...