Acerca de este Curso

2,750 vistas recientes
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Aprox. 17 horas para completar
Inglés (English)
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Aprox. 17 horas para completar
Inglés (English)

ofrecido por

Placeholder

EIT Digital

Programa - Qué aprenderás en este curso

Semana
1

Semana 1

15 minutos para completar

Introduction

15 minutos para completar
1 video (Total 5 minutos), 1 lectura
1 video
1 lectura
Some suggested reading material10m
5 horas para completar

Modeling systems as token consumption/production systems

5 horas para completar
11 videos (Total 70 minutos), 3 lecturas, 6 cuestionarios
11 videos
Consumption and production of tokens5m
Modeling an intensive care unit5m
Modeling a wireless LAN radio4m
Modeling and refining an industrial robot6m
Pick your own system1m
Classes of Petri-nets8m
Causality, choice and concurrency (modeling patterns)9m
Refinement of consumption/production systems8m
Interpreting pictures for performance analysis10m
Draw your own model3m
3 lecturas
Always ask yourself...10m
The refinement of the robot.10m
Tooling10m
5 ejercicios de práctica
Basic modeling ideas30m
Modeling Warehouse 1330m
Modeling features30m
Definition of refinement30m
Which is a refinement of which?30m
Semana
2

Semana 2

5 horas para completar

Syntax and semantics

5 horas para completar
14 videos (Total 103 minutos), 5 lecturas, 5 cuestionarios
14 videos
Syntax and semantics3m
The basics9m
Extensions4m
Prefix orders7m
Exercise on prefix orders7m
Proof that flows form a prefix order14m
Formalizing interpretations as functions8m
Counting is order preserving6m
Formalizing the Petri-net interpretation10m
Proof that the number of tokens in a single-rate dataflow cycle is constant13m
Formalizing timing6m
Formalizing eager scheduling5m
Formalizing periodic scheduling4m
5 lecturas
Flags and Fitch style proofs10m
Slides of the proof10m
Slides of the proof10m
Exercise: Formalize best-case response times10m
About the next quiz.10m
5 ejercicios de práctica
Bipartite graphs30m
Thinking about observation functions30m
Isomorphism30m
Summarize!30m
Formalizing performance properties30m
Semana
3

Semana 3

5 horas para completar

Performance analysis

5 horas para completar
20 videos (Total 131 minutos), 2 lecturas, 5 cuestionarios
20 videos
Throughput is bounded by 1/MCM8m
Proof - a1m
Proof - b9m
Proof - c1m
Proof - d3m
Proof - e7m
Proof - f4m
Proof - g4m
Proof - h8m
Proof - i12m
Proof - j8m
The throughput bound is tight5m
Periodic scheduling of a dataflow graph12m
Latency analysis of a periodic schedule6m
Latency analysis of an eager schedule9m
The formal definition of latency5m
The boot-up time of a dataflow graph4m
Optimizing latency estimates w.r.t. boot-up time5m
Buffering and backpressure5m
2 lecturas
Slides of the proof10m
Alternative proof in synchronization and linearity10m
5 ejercicios de práctica
Summarize!30m
Calculating the MCM and worst-case throughput30m
Calculate some periodic schedules30m
Calculating optimal periodic schedules and their latencies30m
Calculating suitable buffer sizes30m
Semana
4

Semana 4

1 hora para completar

One final example

1 hora para completar
1 video (Total 21 minutos), 5 lecturas
1 video
5 lecturas
2015 Assignment on dataflow modeling.10m
Additional dataflow exercises10m
Example of an exam at masters level (without solutions)10m
Another example of an exam (with solutions)10m
Material created by fellow students10m

Preguntas Frecuentes

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.