Informações sobre o curso

7,310 visualizações recentes
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível avançado

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

Aprox. 60 horas para completar
Inglês

O que você vai aprender

  • 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

Habilidades que você terá

EDF (Earliest Deadline First)Priority Ceiling ProtocolRate Monotonic TheoryPriority Inheritance ProtocolDynamic and Static Scheduling Policies
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível avançado

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

Aprox. 60 horas para completar
Inglês

oferecido por

Placeholder

Universidade do Colorado em Boulder

Comece a trabalhar rumo ao seu mestrado

Este curso é parte da graduação 100% on-line Master of Science in Electrical Engineering da Universidade do Colorado em Boulder. Caso seja aceito para o programa completo, seus cursos contarão para sua graduação.

Programa - O que você aprenderá com este curso

Semana
1

Semana 1

18 horas para concluir

Real-Time Scheduling and Rate Monotonic Least Upper Bound Derivation

18 horas para concluir
14 vídeos (Total 191 mín.), 3 leituras, 7 testes
14 videos
Code Walkthrough: Syslog for Tracing and Autograded Assignments7min
Rate Monotonic Fixed Priority Policy and Optimality (Review)9min
Rate Monotonic Scheduling within the Least Upper Bound12min
Challenges with and Alternatives to Fixed Priority RM Policy16min
Deadline Monotonic Extensions to Rate Monotonic Policy10min
Deadline Driven Scheduling: using Dynamic Priority Alternatives14min
RM LUB Derivation - Introduction12min
Two Cases that Drive the RM Least Upper Bound12min
RM Least Upper Bound Intersection Point10min
RM Least Upper Bound Derivation - Conclusion22min
Necessary and Sufficient Feasibility by Worst-Case Analysis (Exact Test)11min
Exact Feasibility for Rate Monontoic Policy with Scheduling Point24min
Exact Feasibility for Rate Monotonic using Completion Test12min
3 leituras
EXTRA HELP: Home Lab Set Up10min
Read, Review and Understand Derivations in Original RMA Paper (Liu & Layland)2h
Optional: Rate Monotonic Exact Analysis3min
1 exercício prático
Module 1 | Key steps in the RM least upper bound derivation30min
Semana
2

Semana 2

19 horas para concluir

Service Design Feasibility Analysis Practice and Methods of Implementation

19 horas para concluir
14 vídeos (Total 231 mín.), 2 leituras, 7 testes
14 videos
RM Fixed Priority Scheduling Examples with Timing Diagrams12min
More Complex RM Timing Diagrams11min
Timing Diagram with a Harmonic Case12min
Timing Diagram Example Comparing RM and EDF11min
POSIX RT Extension Support16min
General Design Pattern Part-1: AMP RT Functions, Services and Systems19min
General Design Pattern Part-2: Mulit-Core, Multi-Service AMP Systems19min
Implementation Pattern: Periodic Services with POSIX RT Threads, Interval Timers and Signals19min
Message Queues for Synchronization and Data Sharing17min
Code Walkthrough: POSIX RT Feature Demonstration9min
Methods to Determine Worst Case Execution Time (WCET)26min
Methods for WCET Speed-up to Meet Deadlines24min
Service Request Period Jitter and Drift14min
2 leituras
RT Extensions to POSIX - 1003.1 in Linux, QNX, Solaris, FreeBSD, etc.3h
Optional Resources for POSIX 1003.1 RT Extensions3min
1 exercício prático
Module 2 | Service implementation and admission to real-time using RMA, scheduling point, completion test30min
Semana
3

Semana 3

10 horas para concluir

Dynamic priority Earliest Deadline First and Least Laxity First

10 horas para concluir
6 vídeos (Total 73 mín.), 1 leitura, 3 testes
6 videos
Disadvantages of Dynamic Priorities and When EDF should not be used10min
Advantages of Dynamic, Adaptive Scheduling: When to use LLF12min
Disadvantages of Dynamic Adaptive Scheduling: When LLF should not be used3min
Final Comparison of EDF and LLF Failure Modes and Recovery11min
Cheddar Tool Introduction and Overview17min
1 leituras
Rate Monotonic vs. EDF - Judgement Day Paper3h
1 exercício prático
Module 3 | Earliest Deadline First , Least Laxity First30min
Semana
4

Semana 4

13 horas para concluir

Synchronization and Bounded vs. Unbounded Blocking

13 horas para concluir
12 vídeos (Total 134 mín.), 1 leitura, 3 testes
12 videos
Bounded blocking for service release6min
Bounded blocking and Execution Efficiency impact on RT systems6min
Definition of unbounded blocking and examples of root causes17min
Code Walkthrough: Circular Wait - Deadlock Demonstration5min
Code Walkthrough: Can you think of a simple way to break deadlock after a timeout?4min
Review of semaphore use and necessity of Critical Section (C.S.)4min
Code Walk-through: Unbounded Priority Inversion Demonstration8min
Priority Inheritance, Priority Ceiling, and Priority Ceiling Emulation19min
Mars Pathfinder Problem - Rolling Reset 3 Days prior to closest approach to Mars18min
Mars Pathfinder Root Cause Analysis9min
Mars Pathfinder - Bug Localization and the Fix16min
1 leituras
Priority Inversion (Unbounded) and Priority Inheritance Protocol4h
1 exercício prático
Module 4 | Thread synchronization30min

Sobre Programa de cursos integrados Real-Time Embedded Systems

Real-Time Embedded Systems

Perguntas Frequentes – FAQ

Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.