Sciweavers

3 search results - page 1 / 1
» SRPT is 1.86-Competitive for Completion Time Scheduling
Sort
View
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
14 years 2 months ago
SRPT is 1.86-Competitive for Completion Time Scheduling
Christine Chung, Tim Nonner, Alexander Souza
IMSCCS
2006
IEEE
13 years 11 months ago
A New Scheduling Algorithm for Servers
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
Nianmin Yao, Wenbin Yao, Shaobin Cai, Jun Ni
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
13 years 9 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs