3563 search results - page 217 / 713 » Scheduling Algorithms for Procrastinators |
140
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
156
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
118
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
117
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
138
Voted
RTCSA
1999
IEEE
15 years 8 months ago
1999
IEEE
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...