Frequently used formulas and tables.

This document contains some formulas and tables that are frequently used to solve common real-time scheduling exercises. The document will be provided at the exam, alongside with the exam questions (you do NOT need to bring it with you). No other material will be allowed

Course Syllabus (final and complete exams)

For personal use only. Please do not repost or distribute

Sample exam questions.

All original material in this collection is distributed under a Free Culture license. You are free to share, remix, and make commercial use of the work, under the Attribution and Share Alike conditions

Blocking time under basic priority inheritance: Polynomial bound and exact computation

The Priority Inheritance Protocol (PIP) is arguably the best-known protocol for resource sharing under real-time constraints. Its importance in modern applications is undisputed. Nevertheless, because jobs may be blocked under PIP for a variety of reasons, determining a job's maximum blocking time could be difficult, and thus far no exact method has been proposed that does it. Existing analysis methods are inefficient, inaccurate, and of limited applicability. This article proposes a new characterization of the problem, thus allowing a polynomial method for bounding the blocking time, and an exact, optimally efficient method for blocking time computation under priority inheritance that have a general applicability

6. Deadlocks. Memory Management.

For personal use only. Please do not repost or distribute

5. Process Synchronization

For personal use only. Please do not repost or distribute

11. Real-Time: Periodic Task Scheduling

For personal use only. Please do not repost or distribute

7. Paging. Virtual Memory.

For personal use only. Please do not repost or distribute

3. IPC. Threads. Process Scheduling.

For personal use only. Please do not repost or distribute

4. Process Scheduling. Files. Shell.

For personal use only. Please do not repost or distribute