| 
|
Quote: low overhead scheduler combines unsorted queues for Earliest Deadline First (short tasks) with a priority queue for Rate Monotonic (all others)
Topic:
task scheduling
Quotation Skeleton
In EMERALDS, we have implemented EDF [Earliest Deadline First] as follows: All blocked and unblocked tasks lie in a … Tasks are blocked and unblocked by changing one … entire list is parsed and the earliest-deadline ready … [For RM (Rate Monotonic) scheduling] All blocked and unblocked tasks are in … A single pointer highestP points to the highest-priority … [p. 914] [Our combined static/dynamic (CSD) scheduler schedules short period tasks with EDF and the remaining with RM. The dividing line is based on a schedulability analysis. Multiple EDF queues may be used.] … [p. 926] [CSD reduces] scheduling overhead of as much as … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: task scheduling (49 items)