Answered step by step
Verified Expert Solution
Question
1 Approved Answer
1. (40 points) Researchers in the real-time community often evaluate scheduling algorithms (and synchronization protocols) by creating a number of randomly generated task sets of
1. (40 points) Researchers in the real-time community often evaluate scheduling algorithms (and synchronization protocols) by creating a number of randomly generated task sets of size n (usually with a relatively small n, say n S 15) T={(P1, e).... (Pn, en)). For each task set, the maximum scaling factor w is found such that the transformed task set T'={(Pu, we )..... (Pr.wen)} is still schedulable, but for any greater w, the task set would no longer be schedulable with the given scheduling algorithm. The resulting utilization Uw = E=1 we is the breakdown utilization. An algorithm that yields a high average P: breakdown utilization is favoured. We will use this method to evaluate the impact of context-switch times on pre-emptive and non-preemptive EDF scheduling. Create 10 random task sets such that each task set consists of 5 periodic tasks and is schedulable under both pre-emptive EDF and non-premeptive EDF scheduling.(You may want to choose "random task sets such that LCM of periods does not result in excessive number of jobs in the hyper-period). Using these task sets: a. Calculate the breakdown utilization for pre-emptive and non-preemptive EDF when a context-switch time of 6 microseconds (us) is assumed. Be sure to check schedulability precisely. b. Calculate the breakdown utilization for pre-emptive and non-preemptive EDF when a context-switch time of 1006 us is assumed. C. Calculate the average breakdown utilization for pre-emptive and non-preemptive EDF for context-switch times of 206 us, 406 us, and 806 us, and plot these average breakdown utilizations with those calculated in (a) and (b) against the respective context switch time assumed. 1. (40 points) Researchers in the real-time community often evaluate scheduling algorithms (and synchronization protocols) by creating a number of randomly generated task sets of size n (usually with a relatively small n, say n S 15) T={(P1, e).... (Pn, en)). For each task set, the maximum scaling factor w is found such that the transformed task set T'={(Pu, we )..... (Pr.wen)} is still schedulable, but for any greater w, the task set would no longer be schedulable with the given scheduling algorithm. The resulting utilization Uw = E=1 we is the breakdown utilization. An algorithm that yields a high average P: breakdown utilization is favoured. We will use this method to evaluate the impact of context-switch times on pre-emptive and non-preemptive EDF scheduling. Create 10 random task sets such that each task set consists of 5 periodic tasks and is schedulable under both pre-emptive EDF and non-premeptive EDF scheduling.(You may want to choose "random task sets such that LCM of periods does not result in excessive number of jobs in the hyper-period). Using these task sets: a. Calculate the breakdown utilization for pre-emptive and non-preemptive EDF when a context-switch time of 6 microseconds (us) is assumed. Be sure to check schedulability precisely. b. Calculate the breakdown utilization for pre-emptive and non-preemptive EDF when a context-switch time of 1006 us is assumed. C. Calculate the average breakdown utilization for pre-emptive and non-preemptive EDF for context-switch times of 206 us, 406 us, and 806 us, and plot these average breakdown utilizations with those calculated in (a) and (b) against the respective context switch time assumed
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started