1 / 29

APERIODIC TASK SCHEDULING

APERIODIC TASK SCHEDULING. Notation:. Earliest Due Date (EDD) - Jackson’s Rule. Set of tasks:. Problem:. Algorithm:. Earliest Due Date (EDD) - Jackson’s Rule. Earliest Due Date (EDD) – Example 1. Earliest Due Date (EDD) – Example 2. Earliest Due Date (EDD) – Guaranteed Feasibility.

lynna
Télécharger la présentation

APERIODIC TASK SCHEDULING

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. APERIODIC TASK SCHEDULING Notation:

  2. Earliest Due Date (EDD) - Jackson’s Rule Set of tasks: Problem: Algorithm:

  3. Earliest Due Date (EDD) - Jackson’s Rule

  4. Earliest Due Date (EDD) – Example 1

  5. Earliest Due Date (EDD) – Example 2

  6. Earliest Due Date (EDD) – Guaranteed Feasibility Order tasks by increasing deadlines. Then:

  7. Earliest Deadline First (EDF) – Horn’s Algorithm

  8. Earliest Deadline First (EDF) – Horn’s Algorithm

  9. Earliest Deadline First (EDF) – Example

  10. Earliest Deadline First (EDF) – Guarantee of Schedualability Assuming all tasks are ordered by increasing deadlines: Dynamic Scheduling: Assume Schedulable Need to Guarantee that Worst case finishing time: For Guaranteed Schedulability:

  11. The problem is NP hard EDF - Non-Preemptive Scheduling

  12. Non-Acyclic Search Tree Scheduling

  13. Bratley’s Algorithm

  14. Jack Stankovic’s Spring Algorithm This does not yield an optimal schedule, but the general problem is NP hard. This does lend itself to artificial intelligence and learning. The objective is to find a feasible schedule when tasks are have different types of constraints, such as precedence relations, resource constraints, arbitrary arrivals, non-preemptive properties, and importance levels. A heuristic function H is used to drive the scheduling toward a plausible path. At each level of the search, function H is applied to each of the remaining tasks. The task with the smallest value determined by the heuristic function H is selected to extend the current schedule. If a schedule is not looking strongly feasible, a minimal amount of backtracking is used.

  15. Jack Stankovic’s Spring Algorithm Precedence constraints can be handled by adding a term E =1 if the task is eligible and E = infinity if it is not.

  16. Jack Stankovic’s Spring Algorithm

  17. Scheduling with Precedence ConstraintsLatest Deadline First - Optimizes max Lateness

  18. Latest Deadline First

  19. EDF with Precedence Constraints The problem of scheduling a set of n tasks with precedent constraints and dynamic activations can be solved if the tasks are preemptable. The basic ideas is transform a set of dependent tasks into a set of independent tasks by adequate modification of timing parameters. Then, tasks are scheduled by the Earliest Deadline First (EDF) algorithm, iff is schedulable. Basically, all release times and deadlines are modified so that each task cannot start before its predecessors and cannot preempt their successors.

  20. EDF with Precedence Constraints Modifying the release time:

  21. EDF with Precedence Constraints Modifying the Deadlines:

  22. Summary

More Related