Topic
Preemption
About: Preemption is a research topic. Over the lifetime, 1400 publications have been published within this topic receiving 23093 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, the authors study the effects of preemption in games of timing and show that if the gain to preemption is sufficiently small, then the optimal symmetric outcome which involves "late" adoption is an equilibrium.
Abstract: We study the adoption of a new technology to illustrate the effects of preemption in games of timing. We show that the threat of preemption equalizes rents in a duopoly, but that this result does not extend to the general oligopoly game. If the gain to preemption is sufficiently small, then the optimal symmetric outcome, which involves "late" adoption, is an equilibrium. This contrasts with Reinganum's result that in precommitment equilibria there must be "diffusion". We develop a new and richer formalism for modeling games of timing, which permits a continuoustime representation of the limit of discrete-time mixed-strategy equilibria.
938 citations
03 Dec 2007
TL;DR: This paper presents ways to use information from a conjecture that the more confidence one needs in a task execution time bound, the larger and more conservative that bound tends to become in practice.
Abstract: This paper is based on a conjecture that the more confidence one needs in a task execution time bound (the less tolerant one is of missed deadlines), the larger and more conservative that bound tends to become in practice. We assume different tasks perform functions having different criticalities and requiring different levels of assurance. We assume a task may have a set of alternative worst-case execution times, each assured to a different level of confidence. This paper presents ways to use this information to obtain more precise schedulability analysis and more efficient preemptive fixed priority scheduling. These methods are evaluated using workloads abstracted from production avionics systems.
804 citations
TL;DR: It is shown that optimal scheduling without a priori knowledge is impossible in the multiprocessor case even if there is no restriction on preemption owing to precedence or mutual exclusion constraints.
Abstract: The problems of hard-real-time task scheduling in a multiprocessor environment are discussed in terms of a scheduling game representation of the problem. It is shown that optimal scheduling without a priori knowledge is impossible in the multiprocessor case even if there is no restriction on preemption owing to precedence or mutual exclusion constraints. Sufficient conditions that permit a set of tasks to be optimally scheduled at run time are derived. >
480 citations
Patent•
12 Feb 1998
TL;DR: A priority and preemption method for performing a priority and preemptive process includes the steps of satisfying a resource acquisition request from a reserve pool for an external system, and when the resources acquisition request cannot be satisfied from the reserve pool, requesting additional unused frequencies, and preempting active calls as discussed by the authors.
Abstract: A priority and preemption method for performing a priority and preemption process includes the steps of satisfying a resource acquisition request from a reserve pool for an external system, and when the resource acquisition request cannot be satisfied from the reserve pool, requesting additional unused frequencies, and when the additional unused frequencies are not available, requesting to preempt active calls. The method also includes the step of replenishing the power and the frequencies received from the frequency controller, the data hub and/or the independent operations controller when the frequencies are no longer needed by the priority and preemption system.
468 citations
TL;DR: This paper reports results from some investigations into the problem of making optimum use of the remaining processor idle time in scheduling perlodk tasks, and provides an elRcient algorlthm lor determining maximum quantity of total idle time available between any two instants.
Abstract: Abmw&-Task scheduling is an important issue in the design of a renl-timc computer system because tasks have execution deadlines that must be met, otherwise the system fails with severe consequences upon the environment. In this paper, we study the problem of scheduling periodic time critical tasks on a monoprocessor system. A periodic time critkal task consists of an infinite number of -quests, each of whieh has a prescribed deadline. Tasks are assumed to meet their timing requirements when scheduled by the Earliest Deadline algorithm and preemptions are allowed. We report results from some investigations into the problem of making optimum use of the remaining processor idle time in scheduling perlodk tasks either as soon as possible M as late as possible. The major results consist of the statement and proof of properties relating to bcdhtion and duration of idle time intervals and enable us to provide an elRcient algorlthm lor determining maximum quantity of total idle time available between any two instants. We describe how these results can be applied, Brst to the decision problem that arises when a sporadic time critical task occurs and requires to be run at an unpredictable time and second, to the scheduling problem that arises in a fault tolerant system using the deadline mechanism for which each task implements primary and alternate algorithms. Index Terms-Deadline mechanism, idle time, preemptive schedul
447 citations