1 / 6

Real-Time System Requirements and Scheduling: Lecture Series and Homework Assignments

This document outlines a series of lectures and homework assignments focused on real-time system requirements and scheduling methods. Key topics include schedulability verification under Rate Monotonic (RM) and Earliest Deadline First (EDF) scheduling, as well as using polling, sporadic, deferrable, and dynamic sporadic servers. The homework assignments challenge students to apply theoretical concepts to practical scheduling problems, ensuring comprehension of concepts like error states and server utilization. Due dates range from early to mid-May, emphasizing a structured learning path.

fathi
Download Presentation

Real-Time System Requirements and Scheduling: Lecture Series and Homework Assignments

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Home work #1: (Lecture 4/03) From Buttazzo: From Shaw: Exercises 2.2: 1, 2, 3, 5, 6

  2. Lecture 4/17 Real-Time SystemRequirements & Design Specs Shaw - Chapters 3 & 4 Homework #2: 3.3.1, 3.4.1, Add Error states to Fig 4.1

  3. Homework #3 (due 5/3/07) : Lecture 4/24 1) 2) 3)

  4. Homework #4 Lecture 5/1 1) Verify the schedulability under RM of the following task set: 2) Verify the schedulability under EDF, and then construct the corresponding schedule. Due May 8

  5. Homework #5 Lecture 5/15 1) Schedule the following tasks with a Polling Server with intermediate priority. 2) Solve the same scheduling problem with a Sporadic Server with intermediate priority. 3) Solve the same scheduling problem with a Deferrable Server and highest priority. 4) Solve the same scheduling problem utilizing Slack Stealing.

  6. Homework #6 Lecture 5/22 1) Schedule the following tasks with a Dynamic Sporadic Server with Cs = 2 and Ts = 6. 2) Solve the same scheduling problem with a Total Bandwidth Server having utilization Us = 1/3. 3) Solve the same scheduling problem with a Constant Bandwidth Server with Cs = 2 and Ts = 6.

More Related