192 search results - page 20 / 39 » Preemptive Scheduling with Rejection |
ECRTS
2007
IEEE
14 years 4 months ago
2007
IEEE
We propose a hybrid approach for scheduling real-time tasks on large-scale multicore platforms with hierarchical shared caches. In this approach, a multicore platform is partition...
DATE
2006
IEEE
14 years 3 months ago
2006
IEEE
Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of...
ORL
1998
13 years 9 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
JCO
2006
13 years 9 months ago
2006
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...