Abstract
Direct support for deadlines is defined and a new dispatching policy for Earliest Deadline First (EDF) Scheduling is supported.
- Baker, T.P., Stack-Based Scheduling of Real-Time Processes, Journal of Real-Time, Vol 3, No 1, pp67-99, March 1991. Google Scholar
Digital Library
Index Terms
Ada Issue 00357: support for deadlines and earliest deadline first scheduling
Recommendations
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
In this paper, we focus on the semi-partitioned scheduling of sporadic tasks with constrained deadlines and identical processors. We study two cases of semi-partitioning: (i) the case where the worst case execution time (WCET) of a job can be portioned, ...
Preemptive Hadoop Jobs Scheduling under a Deadline
SKG '12: Proceedings of the 2012 Eighth International Conference on Semantics, Knowledge and GridsMapReduce has become the dominant programming model in a cloud-based data processing environment, such as Hadoop. First In First Out (FIFO) is the default job scheduling policy of Hadoop, but it cannot guarantee that the job will be completed by a ...
The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-Time Tasks
AGILE '14: Proceedings of the 2014 Agile ConferenceThe feasibility of preemptive and non-preemptive scheduling has been well investigated on uniprocessor and multiprocessor platforms under both Fixed Priority Scheduling (FPS) and Earliest Deadline First (EDF) paradigms. While feasibility of limited ...






Comments