Preemptive scheduling and antichain polyhedra
نویسندگان
چکیده
منابع مشابه
Approximating Preemptive Stochastic Scheduling
We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online schedulin...
متن کاملPreemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur jobdependent penalties for each rejected job, and he must construct a schedule for the remaining jobs so as to optimize the preemptive makespan on the m machines plus the sum of the penalties of th...
متن کاملOptimal Online Preemptive Scheduling
In this lecture we’ll study online preemptive scheduling on m machines of arbitrary speeds. We’ll first review the problem and it’s associated literature, then give an optimal deterministic algorithm known as ”RatioStretch”. RatioStretch uses the optimal competitive ratio R > 1 as an input, and achieves R whenever such an R is obtainable. The exact optimal R maybe computed via a linear program,...
متن کاملCondor and Preemptive Resume Scheduling
Condor is a batch job system that, unlike many other scheduling systems, allows users to access both dedicated computers and computers that are not always available, perhaps because they are used as desktop computers or are not under local control. This introduces a number of problems, some of which are solved by Condor’s preemptive resume scheduling, which is the focus of this paper. Preemptiv...
متن کاملPreemptive RAID Scheduling
Emerging video surveillance, environmental monitoring applications, and constantly evolving large scientific setups require large, high-performance, and reliable storage systems with guaranteed real-time data access. These systems are often implemented using redundant arrays of independent disks (RAID). In this paper we investigate the effectiveness of preemptive disk-scheduling algorithms to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.05.036