Scheduling Tasks With Variable Deadlines
نویسندگان
چکیده
Traditional real-time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real-time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications. Because the states of the objects change with time, the deadlines may also change with time. This paper discusses the problem of scheduling tasks with variable deadlines and presents preliminary results and on-going work.
منابع مشابه
An Efficient Non-Preemptive Real-Time Scheduling
Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strateg...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملPASS: Power-Aware Scheduling of Mixed Applications with Deadline Constraints on Clusters
Reducing energy consumption has become a pressing issue in cluster computing systems not only for minimizing electricity cost, but also for improving system reliability. Therefore, it is highly desirable to design energy-efficient scheduling algorithms for applications running on clusters. In this paper, we address the problem of non-preemptively scheduling mixed tasks on power-aware clusters. ...
متن کامل3.1 Computing Levels of Responsiveness
We have classiied responsiveness of fault recovery according to the following criterion, If a fault occurs at time t F within the execution of task i , the recovery operation (with computation time C F i) must be serviced before d ij (deadline of the j th activation of task i). Therefore, at time t F the scheduler must nd slack time SL i within t F ; d ij ] for the recovery operation. To servic...
متن کاملMulti-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times
In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor p...
متن کامل