13 search results - page 1 / 3 » Preemptive on-line scheduling for two uniform processors |
MST
2008
13 years 10 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
ORL
1998
13 years 10 months ago
1998
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
RTCSA
2000
IEEE
14 years 3 months ago
2000
IEEE
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than...
IANDC
2008
13 years 11 months ago
2008
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...