Question: Given a non-preemptive aperiodic task set: J1 J2 J3 J4 ai 0 1 2 3 Ci 6 3 4 3 di 15 10 7 8
Given a non-preemptive aperiodic task set:
| J1 | J2 | J3 | J4 | |
| ai | 0 | 1 | 2 | 3 |
| Ci | 6 | 3 | 4 | 3 |
| di | 15 | 10 | 7 | 8 |
Using Bratleys algorithm, answer the following questions: a. Draw the full scheduling tree for the following set of non-preemptive tasks and mark the branches pruned by Bratleys algorithm. b. Is this task set schedulable based on Bratleys algorithm?
Thank you!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
