Exam 1 Study Guide

During this part of the course, you studied the rate-monotonic fixed priority scheduling algorithm and the dynamic priority algorithms: earliest deadline first, least slack time, and shortest completion time. You also worked with QNX and became familiar with some of its primitives and its scheduling.

For this exam you should be able to:

• Describe each scheduling algorithm and write pseudo-code for the scheduler.
• Determine if a scheduling algorithm will create a feasible schedule by using the appropriate schedulability tests. Graduate students are responsible for being able to apply the rate-monotonic schedulability test #3. Undergraduates can gain extra credit by applying that schedulability test also.
• Create an execution trace timeline showing the scheduling of a set of tasks by a particular scheduling algorithm.
• Describe the primitives (including the call signature, usage, and operation) for the following features in QNX:
  • task creation
  • semaphores
  • timers