Preemption threshold scheduling (PTS) provides prominent benefits for fixed priority scheduling such as increased schedulability, reduced context switches, and decreased memory requirements. Since such benefits allow for scalable real-time system design, we have adopted it into our automatic implementation synthesis method for real-time object-oriented models. In this paper, we present the inte...

We propose a technique for analyzing cache-related preemption delays of tasks that cause unpredictable variation in task execution time in the context of fixed-priority preemptive scheduling. The proposed technique consists of two steps. The first step performs a per-task analysis to estimate cache-related preemption cost for each execution point in a given task from the number of useful cache ...

Handling cache related preemption delay (CRPD) in a preemptive scheduling context for real-time systems stays an open subject despite of its practical importance. Priority assignment algorithms and feasibility tests are usually based on the assumption that preemption cost is negligible. Then, a system that could be schedulable at design time can fail to meet its timing constraints in practice d...

Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, or when the network experiences link or node failures. Coupled Ž . with the capability to reroute connections preempted due to failure or preemption , connection preemption allows a high quality of service to be provide...

In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization of the total tardiness. The model is tested against random instances. The results allow us to identify the effect of some parameters such as c...

GPRS extends the widely deployed GSM system with a more efficient wireless Internet access. In this paper we investigate how a TCP transmission over GPRS is affected when it loses all its resources due to preemption by circuit-switched calls with higher priority. The results indicate that TCP performance is degraded more than necessary, as buffered data is flushed immediately when the GPRS traf...

Preemption is a possible way to ensure emergency traffic’s priority in wireless network. But a pure preemption policy can be especially harsh to low priority calls. A way to improve this is introducing a queuing mechanism, which means putting preempted calls into a queue so that they can resume when channels become available, as long as they do not give up due to waiting too long in the queue. ...

We show that the problems of minimizing total completion time and of minimizing the number of late jobs on unrelated parallel machines, when preemption is allowed, are both NP-hard in the strong sense. The former result settles a long-standing open question. A special case of the unrelated machine model is the identical machine model with the restriction that a job can only be processed on a sp...

Fixed Priority Scheduling with Deferred Preemption (FPDS) offers a balance between Fixed Priority Non-preemptive Scheduling (FPNS) and Fixed Priority Preemptive Scheduling (FPPS), by allowing preemptions only at specified preemption points. It provides finer grained preemptions than FPNS, improving the schedulability of higher priority tasks, and a coarser grain preemptions than FPPS, reducing ...

Abstract The counterfactual comparative account of harm faces problems in cases that involve overdetermination and preemption. An influential strategy for dealing with these problems, drawing on a suggestion made by Derek Parfit, is to appeal plural —several events together harming someone. We argue the most well-known version this strategy, due Neil Feit, as well Magnus Jedenheim Edling’s more...