Consider a set of three periodic real-time tasks that are to be run on a uniprocessor using a rate monotonic scheduler. The task characteristics are given in the following table. How many context switches would each job of Task4 suffer?
Task Set (All times are in milliseconds)
Task Name
Phase
Execution time
Period
Deadline
Task1
200
10
100
100
Task2
150
25
150
150
Task3
100
20
40
40
Task4
0
15
200
200
a.1
b.2
c.4
d.6
e.8
Ans – A
1 point
Consider a set of three periodic real-time tasks that are to be run on a uniprocessor embedded system using a rate monotonic scheduler. The task characteristics are given in the following table. Assume that time overhead for a context switch is 1milliseconds. What will be the worst case completion time of Task2?Task Set (All times are in milliseconds)
Task Name
Phase
Execution time
Period
Deadline
Task1
200
10
100
100
Task2
150
25
150
150
Task3
100
20
40
40
Task4
0
15
200
200
a.125 milli Seconds
b.127 milli Seconds
c.137 milli Seconds
d.139 milli Seconds
e.143 milli Seconds
Ans – B
1 point
Consider a set of three periodic real-time tasks that are to be run on a uniprocessor using a rate monotonic scheduler. The task characteristics are given in the following table. What would be the worst case completion time for Task2?Task Set (All times are in milliseconds)
Task Name
Phase
Execution time
Period
Self Suspension time
Deadline
Task1
10
10
100
5
100
Task2
150
15
150
5
150
Task3
100
10
40
2
40
Task4
50
25
200
10
200
a.65 milliseconds
b.73 milliseconds
c.87 milliseconds
d.105 milliseconds
e.109 milliseconds
Ans – E
1 point
Consider a set of three periodic real-time tasks that are to be run on a uniprocessor using a rate monotonic scheduler. The task characteristics are given in the following table. Assume that each context switch overhead is 1 milli second. What would be the worst case completion time for Task1?Task Set (All times are in milliseconds)
Task Name
Phase
Execution time
Period
Self Suspension time
Deadline
Task1
10
10
100
5
100
Task2
150
15
150
5
150
Task3
100
10
40
2
40
Task4
50
25
200
10
200
a.40 milliseconds
b.42 milliseconds
c.59 milliseconds
d.73 milliseconds
e.87 milliseconds
f.95 milliseconds
Ans – D
Consider a set of three periodic real-time tasks that are to be run on a uniprocessor using a rate monotonic scheduler. The task characteristics are given in the following table. Assume that each context switch overhead is 1 milli second. What would be the worst case completion time for Task4?
Task Set (All times are in milliseconds)
Task Name
Phase
Execution time
Period
Deadline
Task1
10
10
100
100
Task2
150
15
150
150
Task3
100
10
40
40
Task4
50
25
200
200
a.137 milliseconds
b.145 milliseconds
c.173 milliseconds
d.215 milliseconds
e.231 milliseconds
Ans – A
Consider a set of four periodic real-time tasks that are to be run on a uniprocessor using a rate monotonic scheduler. The task characteristics are given in the following table. However, it was noted that Task2 is the most critical task. By applying the period transformation technique, what would be the execution time and period of Task2?
Task Set (All times are in milliseconds)
Task Name
Phase
Execution time
Period
Deadline
Task1
200
10
100
100
Task2
150
20
120
150
Task3
100
20
40
40
Task4
0
15
200
200
a.Execution time=10, Period=60
b.Execution time=10, Period=40
c.Execution time=8, Period=35
d.Execution time=5, Period=30
e.Execution time=5, Period=20
Ans – B
Which of the following are FALSE concerning a deferable server?(multiple options)
a.It serves a set of aperiodic tasks
b.It is an aperiodic task
c.It has much better response time for aperiodic tasks compared to polling server.
d.It preserves its execution time till the end of its period, if no aperiodic tasks are ready.
e.Its implementation is much more simpler than a polling server
Ans – C
Which of the following are FALSE concerning a priority exchange server?
a.It serves a set of aperiodic tasks
b.It is an aperiodic task
c.It has much better response time for aperiodic tasks compared to polling server.
d.It preserves its execution time till the end of its period, if no aperiodic tasks are ready.
e.It has much better response time for aperiodic tasks compared to deferable server.
f. When the priority exchange server is invoked by the scheduler, if no aperiodic tasks are ready, it exchanges its priority with a lower priority task that is ready.
g. Its implementation is simpler than a deferable server Consider a set of six periodic real-time tasks that are to be run on a uniprocessor-based embedded system using a rate monotonic scheduler. However, the embedded operating system supports only four priority levels? Which one of the following is the priority assignment using the uniform scheme? Assume pri(Ti) is the priority of Ti and priority level 1 is the highest priority and 4 is the lowest priority.
Ans – D
Task Set (All times are in milliseconds)
Task Name
Phase
Execution time
Period
Deadline
T1
200
10
100
100
T2
150
20
120
150
T3
100
20
40
40
T4
0
15
200
200
T5
50
35
300
300
T6
100
15
400
400
a.pri(T1)=1, pri(T2)=2, pri(T3)=3,pri(T4)=4,pri(T5)=4,pri(T6)=4
b.pri(T1)=2, pri(T2)=3, pri(T3)=1,pri(T4)=4,pri(T5)=3,pri(T6)=4
c.pri(T1)=3, pri(T2)=1, pri(T3)=2,pri(T4)=4,pri(T5)=4,pri(T6)=4
d.pri(T1)=2, pri(T2)=3, pri(T3)=1,pri(T4)=4,pri(T5)=4,pri(T6)=4
e.pri(T1)=3, pri(T2)=2, pri(T3)=1,pri(T4)=4,pri(T5)=1,pri(T6)=2 Which one of the following statement about the period transformation technique is true?
a.It is used for assign priority to some tasks with very long periods have very high criticality and to perform schedulability analysis in this situation
b.It is used for assign priority to some tasks with very short periods have very high criticality and to perform schedulability analysis in this situation
c.It essentially enables scheduling sporadic tasks by a rate monotonic scheduler by logically transforming those tasks into periodic tasks
d.It essentially enables scheduling aperiodic tasks by a rate monotonic scheduler by logically transforming those tasks into periodic tasks
Ans – C