À propos de ce cours

14,343 consultations récentes
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau avancé

C programming skills, some prior experience with an operating system, and prior embedded hardware experience is a plus.

Approx. 60 heures pour terminer
Anglais

Ce que vous allez apprendre

  • Methods to analyze dynamic prioirty real-time service feasibility

  • Methods to control unbounded priority inversion problems

  • Avoiding and recovering from deadlock

  • Avoiding and recovering from unbounded priority inversion

Compétences que vous acquerrez

EDF (Earliest Deadline First)Priority Ceiling ProtocolRate Monotonic TheoryPriority Inheritance ProtocolDynamic and Static Scheduling Policies
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau avancé

C programming skills, some prior experience with an operating system, and prior embedded hardware experience is a plus.

Approx. 60 heures pour terminer
Anglais

Offert par

Placeholder

Université du Colorado à Boulder

Commencez à travailler pour obtenir votre master

Ce cours fait partie du diplôme intégralement en ligne Master of Science in Electrical Engineering de Université du Colorado à Boulder. Si vous êtes admis au programme complet, vos cours seront pris en compte dans votre apprentissage diplômant.

Programme du cours : ce que vous apprendrez dans ce cours

Semaine
1

Semaine 1

18 heures pour terminer

Real-Time Scheduling and Rate Monotonic Least Upper Bound Derivation

18 heures pour terminer
14 vidéos (Total 191 min), 3 lectures, 7 quiz
14 vidéos
Code Walkthrough: Syslog for Tracing and Autograded Assignments7 min
Rate Monotonic Fixed Priority Policy and Optimality (Review)9 min
Rate Monotonic Scheduling within the Least Upper Bound12 min
Challenges with and Alternatives to Fixed Priority RM Policy16 min
Deadline Monotonic Extensions to Rate Monotonic Policy10 min
Deadline Driven Scheduling: using Dynamic Priority Alternatives14 min
RM LUB Derivation - Introduction12 min
Two Cases that Drive the RM Least Upper Bound12 min
RM Least Upper Bound Intersection Point10 min
RM Least Upper Bound Derivation - Conclusion22 min
Necessary and Sufficient Feasibility by Worst-Case Analysis (Exact Test)11 min
Exact Feasibility for Rate Monontoic Policy with Scheduling Point24 min
Exact Feasibility for Rate Monotonic using Completion Test12 min
3 lectures
EXTRA HELP: Home Lab Set Up10 min
Read, Review and Understand Derivations in Original RMA Paper (Liu & Layland)2 h
Optional: Rate Monotonic Exact Analysis3 min
1 exercice pour s'entraîner
Module 1 | Key steps in the RM least upper bound derivation30 min
Semaine
2

Semaine 2

19 heures pour terminer

Service Design Feasibility Analysis Practice and Methods of Implementation

19 heures pour terminer
14 vidéos (Total 231 min), 2 lectures, 7 quiz
14 vidéos
RM Fixed Priority Scheduling Examples with Timing Diagrams12 min
More Complex RM Timing Diagrams11 min
Timing Diagram with a Harmonic Case12 min
Timing Diagram Example Comparing RM and EDF11 min
POSIX RT Extension Support16 min
General Design Pattern Part-1: AMP RT Functions, Services and Systems19 min
General Design Pattern Part-2: Mulit-Core, Multi-Service AMP Systems19 min
Implementation Pattern: Periodic Services with POSIX RT Threads, Interval Timers and Signals19 min
Message Queues for Synchronization and Data Sharing17 min
Code Walkthrough: POSIX RT Feature Demonstration9 min
Methods to Determine Worst Case Execution Time (WCET)26 min
Methods for WCET Speed-up to Meet Deadlines24 min
Service Request Period Jitter and Drift14 min
2 lectures
RT Extensions to POSIX - 1003.1 in Linux, QNX, Solaris, FreeBSD, etc.3 h
Optional Resources for POSIX 1003.1 RT Extensions3 min
1 exercice pour s'entraîner
Module 2 | Service implementation and admission to real-time using RMA, scheduling point, completion test30 min
Semaine
3

Semaine 3

10 heures pour terminer

Dynamic priority Earliest Deadline First and Least Laxity First

10 heures pour terminer
6 vidéos (Total 73 min), 1 lecture, 3 quiz
6 vidéos
Disadvantages of Dynamic Priorities and When EDF should not be used10 min
Advantages of Dynamic, Adaptive Scheduling: When to use LLF12 min
Disadvantages of Dynamic Adaptive Scheduling: When LLF should not be used3 min
Final Comparison of EDF and LLF Failure Modes and Recovery11 min
Cheddar Tool Introduction and Overview17 min
1 lecture
Rate Monotonic vs. EDF - Judgement Day Paper3 h
1 exercice pour s'entraîner
Module 3 | Earliest Deadline First , Least Laxity First30 min
Semaine
4

Semaine 4

13 heures pour terminer

Synchronization and Bounded vs. Unbounded Blocking

13 heures pour terminer
12 vidéos (Total 134 min), 1 lecture, 3 quiz
12 vidéos
Bounded blocking for service release6 min
Bounded blocking and Execution Efficiency impact on RT systems6 min
Definition of unbounded blocking and examples of root causes17 min
Code Walkthrough: Circular Wait - Deadlock Demonstration5 min
Code Walkthrough: Can you think of a simple way to break deadlock after a timeout?4 min
Review of semaphore use and necessity of Critical Section (C.S.)4 min
Code Walk-through: Unbounded Priority Inversion Demonstration8 min
Priority Inheritance, Priority Ceiling, and Priority Ceiling Emulation19 min
Mars Pathfinder Problem - Rolling Reset 3 Days prior to closest approach to Mars18 min
Mars Pathfinder Root Cause Analysis9 min
Mars Pathfinder - Bug Localization and the Fix16 min
1 lecture
Priority Inversion (Unbounded) and Priority Inheritance Protocol4 h
1 exercice pour s'entraîner
Module 4 | Thread synchronization30 min

Foire Aux Questions

D'autres questions ? Visitez le Centre d'Aide pour les Etudiants.