Journal ArticleDOI
Tests for global EDF schedulability analysis
Marko Bertogna,Sanjoy Baruah +1 more
Reads0
Chats0
TLDR
A recommended approach to schedulability analysis is proposed, that suggests a particular order in which to apply preexisting tests, thereby accomplishing both good provable performance and good behavior in practice.About:
This article is published in Journal of Systems Architecture.The article was published on 2011-05-01. It has received 73 citations till now. The article focuses on the topics: Earliest deadline first scheduling & Multiprocessor scheduling.read more
Citations
More filters
Scheduling and locking in multiprocessor real-time operating systems
TL;DR: The experiments show that partitioned earliest-deadline first (EDF) scheduling is generally preferable in a hard real- time setting, whereas global and clustered EDF scheduling are effective in a soft real-time setting.
Proceedings ArticleDOI
Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks
TL;DR: The federated scheduling algorithm proposed in this paper is a generalization of partitioned scheduling to parallel tasks and shows that if on unit-speed cores, a task set has total utilization of at most m and the critical-path length of each task is smaller than its deadline, then Federated scheduling can schedule that task set.
Proceedings ArticleDOI
Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks
TL;DR: Simulations confirm that the GEDF is not only safe under the capacity augmentation bound for various randomly generated task sets, but also performs surprisingly well and usually outperforms an existing scheduling technique that involves task decomposition.
Proceedings ArticleDOI
Optimal Selection of Preemption Points to Minimize Preemption Overhead
TL;DR: This paper derives an optimal algorithm for the optimal selection of preemption points under the restrictive assumption of a fixed preemption cost, identical for each preemption point, from an integer programming formulation with exponential worst-case complexity.
Journal ArticleDOI
Global EDF scheduling for parallel real-time tasks
TL;DR: The global earliest deadline first (GEDF) scheduling policy for task sets consisting of parallel tasks, which it is shown that GEDF performs surprisingly well and outperforms an existing scheduling techniques that involves task decomposition.
References
More filters
Proceedings ArticleDOI
Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance
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.
Proceedings ArticleDOI
Preemptively scheduling hard-real-time sporadic tasks on one processor
TL;DR: The authors first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable) and lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.
Journal ArticleDOI
Optimal Time-Critical Scheduling via Resource Augmentation
TL;DR: In this paper, the authors consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemptive multiprocessor setting, and scheduling to provide good response time in a number of scheduling environments.
Journal ArticleDOI
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
TL;DR: A new priority-driven algorithm is proposed for scheduling periodic task systems upon multiprocessor platforms: this algorithm is shown to successfully schedule some task systems for which EDF may fail to meet all deadlines.
Proceedings ArticleDOI
Multiprocessor EDF and deadline monotonic schedulability analysis
TL;DR: Schedulability tests are presented for preemptive earlier-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single-queue m-server system, in which the deadline may be less than or equal to the task period.
Related Papers (5)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
C. L. Liu,James W. Layland +1 more