Exercise 1 - The laboratory assignment: development system and target
hardware
Thu study week 1, 10.15 - 12.00 in Svea118
In this exercise, we give an overview of the laboratory assignment, in terms
of the main objectives of the assignment and also in terms of the hardware
platform and software development tools being used. We also present
some special considerations when using the TinyTimber kernel.
Slides
[
PDF,
PDF_4up,
PDF_3up ]
Exercise 2 - Programming with the TinyTimber kernel
Tue study week 2, 15.15 - 17.00 in Svea130
In this exercise, we demonstrate how to add the call-back
functionality to the mutex methods provided by the TinyTimber kernel. We then
show how to implement semaphores in C using the TinyTimber kernel and the
call-back functionality add-on.
Slides
[ PDF,
PDF_4up,
PDF_3up ]
Exercise 3 - Programming with the TinyTimber kernel
Tue
study week 3, 15.15 - 17.00 in
Svea130
In this exercise, we demonstrate how to implement periodic tasks in
TinyTimber. In addition, we will show how to impose deadlines to periodic
tasks and how to stop a periodic task after it has executed for a certain
number of time units.
Slides
[
PDF,
PDF_4up,
PDF_3up ]
Exercise 4 - Worst-case
execution times
Tue study week 4,
15.15 - 17.00 in Gamma
In this exercise, we will learn how estimate the worst-case execution
time (WCET) for
a given piece of code using Shaw's method.
Slides
[ PDF,
PDF_4up,
PDF_3up ]
Exercise 5 - Uniprocessor schedulability analysis
Fri study week
6a, 10.15 - 12.00 in
Svea130
In this exercise, we will solve problems related to
pseudo-parallel execution on a uniprocessor with
the Rate-Monotonic (RM) and Earliest-Deadline First (EDF) scheduling
policies, including the use of processor utilization analysis. In addition, we
will learn how to generate a time table for a system that uses a cyclic
executive.
Slides
[ PDF,
PDF_4up,
PDF_3up
]
Exercise 6 - Uniprocessor schedulability analysis
(cont'd)
Mon study week 7, 13.15 - 15.00 in Gamma
In this exercise, we will solve uniprocessor scheduling problems related to
the Deadline-Monotonic (DM) and Earliest-Deadline First (EDF) scheduling
policies. The solutions to the problems are based on response-time analysis
for DM and processor-demand analysis for EDF.
Slides
[ PDF,
PDF_4up,
PDF_3up ]
Exercise 7 - Multiprocessor schedulability analysis
Thu study week 7,
10.15 - 12.00 in Gamma
In this exercise, we will solve multiprocessor
scheduling problems. The solutions to the problems are based on processor
utilization analysis for the RMFF and RM-US scheduling policies. We will learn that successfully
assigning the tasks to the processors using the RMFF scheduling policy depends on the
order of the tasks considered during the assignment process. We
will also demonstrate how to compute a pessimistic upper bound on the response time of tasks scheduled using the RM-US
policy.
Slides
[ PDF,
PDF_4up,
PDF_3up ]