Unless otherwise noted the exercises are taken from the exercise compendium (EXC).
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.
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 implement semaphores in C using the TinyTimber kernel and the call-back functionality add-on.
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.
In this exercise, we will learn how the worst-case execution time (WCET) is estimated for a given piece of code using Shaw's method.
In this exercise, we will solve problems related to dynamic scheduling with the Rate-Monotonic (RM) and Earliest-Deadline First (EDF) scheduling algorithms, including on the use of the processor-utilization test. Also, we will learn how to generate a time table for a system that uses static scheduling.
In this exercise, we will solve scheduling problems related to Rate-Monotonic (RM), Deadline-Monotonic (DM) and Earliest-Deadline First (EDF) scheduling. The solutions to the problems are based on response-time analysis for RM/DM and processor-demand analysis for EDF. In addition, a solution of a scheduling problem using extended response time analysis (due to shared resources) considering the ICPP protocol will be demonstrated.
In this exercise, our objective is to solve problems related to multiprocessor scheduling algorithms. We will solve problems related to the utilization bound tests for RMFF and RM-US algorithms. We will learn that successfully assigning the tasks to the processors for the RMFF algorithm depends on the order of the tasks considered during the assignment process. Finally, we will demonstrate how to compute an upper bound on the response time of the tasks scheduled using the RM-US algorithm.
Printable version