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...

The analysis of fixed priority preemptive scheduling has been extended in various ways to improve its usefulness for the design of real-time systems. In this paper, we define the layered preemptive priority scheduling policy which generalizes fixed preemptive priorities by combination with other policies in a layered structure. In particular, the combination with the Round Robin scheduling poli...

This paper considers a single-machine scheduling with preventive periodic maintenance activities in remanufacturing system. Although the scheduling problem with maintenance has attracted researchers’ attention, most of past studies consider only non-preemptive jobs. In fact, there exist both preemptive and non-preemptive jobs due to their different processing technic in remanufacturing workshop...

Preemptive multi-tasking is a commonly used architecture for designing and implementing embedded real-time software. However, preemptive multi-tasking comes with its own costs. These costs include overheads due to preemptions and context-switches that result in waste of CPU bandwidth. Also, each task incurs a memory cost largely due to the need to maintain a separate stack for each task. These ...

Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling criteria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quantum (CTQ) approach combined with the round-robin algorithm, we try to adjust the time quantum according to the burst times of the tasks in the ready queue. There are two important bene...

We design an algorithm of the best possible competitive ratio for preemptive and non-preemptive scheduling of unit size jobs with rejection on three identical machines. The algorithm does not use preemption even for the preemptive variant, and it has the interesting feature that one of its parameters is not fixed in advance, and it is defined based on the properties of the first input job havin...

Problem statement: One of the Cloud Services, Infrastructure as a Service (IaaS) provides a Compute resourses for demand in various applications like Parallel Data processing. The computer resources offered in the cloud are extremely dynamic and probably heterogeneous. Nephele is the first data processing framework to explicitly exploit the dynamic resource allocation offered by today’s IaaS cl...

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...

We consider parallel machine scheduling problems with identical machines and preemption allowed. It is shown that every such problem with chain precedence constraints and release dates and an integer-concave objective function satisfies the following integrality property : for any problem instance with integral data there exists an optimal schedule where all interruptions occur at integral date...

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...