Results 1  10
of
1,296
preemptive scheduling
, 2010
"... Abstract. In this paper, we propose a method for the verification of timed properties for realtime systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time Petri net, is first translated into a linear hybrid automaton to which it is timebisimilar. Timed properties ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we propose a method for the verification of timed properties for realtime systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time Petri net, is first translated into a linear hybrid automaton to which it is timebisimilar. Timed
Preemptive Scheduling for Distributed Systems
, 1998
"... Preemptive scheduling is widespread in operating systems and in parallel processing on symmetric multiprocessors. However, in distributed systems it is practically unheard of. Scheduling in distributed systems is an important issue, and has performance impact on parallel processing, load balancing a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Preemptive scheduling is widespread in operating systems and in parallel processing on symmetric multiprocessors. However, in distributed systems it is practically unheard of. Scheduling in distributed systems is an important issue, and has performance impact on parallel processing, load balancing
Preemptive scheduling with rejection
, 2003
"... 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 jo ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
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
Preemptive Scheduling of Identical Machines
, 2000
"... We study the scheduling situation where jobs, subject to duedates or deadlines, have to be preemptively scheduled on parallel identical machines. We rst provide a closed form expression for the optimum value of Lmax , the maximal lateness. We show that it can be computed in O(n log n), hence improv ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We study the scheduling situation where jobs, subject to duedates or deadlines, have to be preemptively scheduled on parallel identical machines. We rst provide a closed form expression for the optimum value of Lmax , the maximal lateness. We show that it can be computed in O(n log n), hence
Structural Properties of Preemptive Schedules
"... Consider some preemptive scheduling problem, i.e., a problem where we can interrupt operations and resume them later without any penalties. What can we say about the optimal schedule? When does the optimal schedule exist? When does it have a limited (polynomial) number of interruptions? Do they occ ..."
Abstract
 Add to MetaCart
Consider some preemptive scheduling problem, i.e., a problem where we can interrupt operations and resume them later without any penalties. What can we say about the optimal schedule? When does the optimal schedule exist? When does it have a limited (polynomial) number of interruptions? Do
Robust Algorithms for Preemptive Scheduling
 ALGORITHMICA
, 2012
"... Preemptive scheduling problems on parallel machines are classic problems. Given the goal of minimizing the makespan, they are polynomially solvable even for the most general model of unrelated machines. In these problems, a set of jobs is to be assigned to run on a set of m machines. A job can be sp ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Preemptive scheduling problems on parallel machines are classic problems. Given the goal of minimizing the makespan, they are polynomially solvable even for the most general model of unrelated machines. In these problems, a set of jobs is to be assigned to run on a set of m machines. A job can
WCET ANALYSIS FOR PREEMPTIVE SCHEDULING
, 2008
"... Hard realtime systems induce strict constraints on the timing of the task set. Validation of these timing constraints is thus a major challenge during the design of such a system. Whereas the derivation of timing guarantees must already be considered complex if tasks are running to completion, it g ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
, it gets even more complex if tasks are scheduled preemptively – especially due to caches, deployed to improve the average performance. In this paper we propose a new method to compute valid upper bounds on a task’s worst case execution time (WCET). Our method approximates an optimal memory layout
Preemptive scheduling on selfish machines
"... We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimize the makespan, whereas the goal of the agents is to maximize their profit. We show that a known algorithm is monoton ..."
Abstract
 Add to MetaCart
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimize the makespan, whereas the goal of the agents is to maximize their profit. We show that a known algorithm
Preemptive scheduling of parallel jobs on multiprocessors
 In SODA
, 1996
"... Abstract. We study the problem of processor scheduling for n parallel jobs applying the method of competitive analysis. We prove that for jobs with a single phase of parallelism, a preemptive scheduling algorithm without information about job execution time can achieve a mean completion time within ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
Abstract. We study the problem of processor scheduling for n parallel jobs applying the method of competitive analysis. We prove that for jobs with a single phase of parallelism, a preemptive scheduling algorithm without information about job execution time can achieve a mean completion time within
Preemptive Scheduling Of Uniform Processors With Memory
, 1981
"... We consider the problem of preemptively scheduling n jobs on a system of m uniform processors. Each job has a release time, a due time, and a memory requirement associated with it. Each processor has a speed and a memory capacity associated with it. Linear programming formulations are obtained for t ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We consider the problem of preemptively scheduling n jobs on a system of m uniform processors. Each job has a release time, a due time, and a memory requirement associated with it. Each processor has a speed and a memory capacity associated with it. Linear programming formulations are obtained
Results 1  10
of
1,296