Main
ECE 576 - Homework Assignment 4
Due Tuesday, April 27, beginning of lecture (no later than 9:35am)
1. (5 points) Rate Monotonic Scheduling
For the following set of tasks:
a.) Determine the priority for each task using a rate monotonic priority assignment.
b.) Does this task set pass the utilization test?
c.) Is this task set schedulable? Justify your answer by providing a timeline that either demonstrates when a task misses its deadline or demonstrates that all task deadlines can be met. Be sure to clearly illustrate when any tasks are preempted by a higher priority task.
| Task (Ti) | Period (Pi) | Exec. Time (Ci) |
| A | 15 | 4 |
| B | 20 | 8 |
| C | 30 | 5 |
2. (5 points) Deadline Monotonic Scheduling
For the following set of tasks:
a.) Determine the priority for each task using a deadline monotonic priority assignment.
b.) Does this task set pass the utilization test?
c.) Is this task set schedulable? Justify your answer by providing a timeline that either demonstrates when a task misses its deadline or demonstrates that all task deadlines can be met. Be sure to clearly illustrate when any tasks are preempted by a higher priority task.
| Task (Ti) | Period (Pi) | Deadline (Di) | Exec. Time (Ci) |
| A | 30 | 25 | 5 |
| B | 60 | 30 | 7 |
| C | 40 | 10 | 5 |
| D | 24 | 12 | 12 |
3. (10 points) Response Time Analysis
For the tasks sets in problems 1 and 2, determine the response time for each task. According to the response time analysis, demonstrate whether or not each task set is schedulable.
4. (10 points) Synchronous Dataflow (SDF)
For the following synchronous dataflow model:
a.) Determine a single appearance schedule. Calculate the buffer requirements for the dataflow model given your schedule, including buffer requirements for storing initial data tokens within the system.
b.) Determine a schedule that minimizes the buffer requirements.
c.) Describe the difference between a general dataflow model and synchronous dataflow model.