192 search results - page 8 / 39 » Preemptive Scheduling with Rejection |
IANDC
2008
13 years 10 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...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
OLTP and transactional workloads are increasingly common in computer systems, ranging from ecommerce to warehousing to inventory management. It is valuable to provide priority sch...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
ECRTS
2009
IEEE
13 years 7 months ago
2009
IEEE
Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic ...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...