359 search results - page 9 / 72 » Order Scheduling Models: Hardness and Algorithms |
EUROPAR
2009
Springer
14 years 7 days ago
2009
Springer
Multicore architectures featuring specialized accelerators are getting an increasing amount of attention, and this success will probably influence the design of future High Perfor...
ISPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Scheduling divisible loads in distributed systems is the subject of Divisible Load Theory (DLT). In this paper we show that coalitional game theory is a natural fit for modeling ...
RTAS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
ECRTS
2000
IEEE
14 years 1 days ago
2000
IEEE
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
WSC
2007
13 years 10 months ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...