Instructions: Please Note That, No Identical Answers Will Be Given Credit
This document contains an assignment for a real-time systems course. It includes 4 questions:
1. Model a hard real-time system by partitioning it into tasks, identifying periodic/aperiodic/sporadic tasks, grouping tasks sets, and suggesting scheduling algorithms.
2. Draw a timing diagram and compare average response times with and without slack stealing for a 3-task system scheduled with a cyclic executive algorithm.
3. Analyze the schedulability of a 3-task periodic system using rate monotonic analysis and iterative response time analysis.
4. Construct a schedule for a 4-task resource-sharing system using priority ceiling protocol and comment on its schedulability.
Instructions: Please Note That, No Identical Answers Will Be Given Credit
This document contains an assignment for a real-time systems course. It includes 4 questions:
1. Model a hard real-time system by partitioning it into tasks, identifying periodic/aperiodic/sporadic tasks, grouping tasks sets, and suggesting scheduling algorithms.
2. Draw a timing diagram and compare average response times with and without slack stealing for a 3-task system scheduled with a cyclic executive algorithm.
3. Analyze the schedulability of a 3-task periodic system using rate monotonic analysis and iterative response time analysis.
4. Construct a schedule for a 4-task resource-sharing system using priority ceiling protocol and comment on its schedulability.
M.S. System software Second Semester 2013-2014 Assignment No. I
Course No. : BITS ZG 553 Course Title : Real-Time Systems Weightage : 5%
I nstructions: Please note that, no identical answers will be given credit. All questions carry equal weightage.
Q 1. Choose any hard real-time system of your choice and model the system. Modeling should consist of -- Proper partitioning the system -- Identifying the various periodic, aperiodic and sporadic tasks -- Grouping the tasks into task set and identifying proper precedence and dependency among tasks -- suggesting suitable scheduling algorithms for various task sets -- Adding any relevant information, you want to add
Q 2. . A system of three tasks T 1 (4,1) ; T 2 (4,1.5,6) and T 3 (5,0.5) is to be scheduled with clock-driven cyclic executive algorithm. a) Draw a neat timing diagram choosing proper frame size. b) If a stream of aperiodic jobs A 1 (4,1.5), A 2 (9.5,0.5) and A 3 (10.5,2) arrives, how will you schedule this stream by using cyclic executive method ? c) Now apply slack stealing. Compare average response time in both cases.
Q 3. Consider a periodic task set consisting of three tasks, T i (p i , e i ,) = {(7,3);(12,3);(20,5)} Where p is period, e is execution time of the task T i . Complete the response time analysis using RM scheduling algorithm i. Apply utilization based scheduling test and determine whether the system is schedulable or not. ii. Use iterative method of time demand analysis to determine whether the system is schedulable or not.
Q 4. Consider the following tasks with their resource requirements given as Ti (r i , e i , i [R; t]). T 1 (10, 4,1 [A; 1]) where task executes for two units of time then requests the resource A. T 2 (7, 4, 2 [A; 1][B; 1]) where task executes for one unit, then requests A and B. T 3 (4, 4, 3 [B; 1][C; 1]) where task executes for one unit then requests B and C. T 4 (0, 11, 4 [A; 5[B; 2][C; 1]]) where task executes for two units of time then requests A, hold it for one unit of time and makes a nested request for B and C. i. Construct the schedule for the system using priority-ceiling protocol. ii. Comment on schedulability .using Priority-Ceiling Protocol.