16/05/2018 Real Time Operating System - - Unit 4 - Week 3

reviewer1@nptel.iitm.ac.in ▼

Courses » Real Time Operating System

Announcements Course Ask a Question Progress Mentor

Unit 4 - Week 3

Course
outline Assignment 3
The due date for submitting this assignment has passed. Due on 2018-02-28, 23:59 IST.
How to access
the portal Submitted assignment

Week 1 1) Consider a certain application in which two periodic real-time tasks 1 point
are to be run on a uniprocessor using a rate monotonic scheduler. What should
Week 2 be the maximum processor utilization due to the two tasks, if it is required that
the two tasks should run without missing any deadlines?
Week 3
0.88
Lecture 11 : 0.82
RMA
0.76
Generalizations
0.73
Lecture 12 :
Further RMA No, the answer is incorrect.
Generalizations Score: 0
Lecture 13 : Accepted Answers:
Resource 0.82
Sharing among
Real-Time 2) Suppose a single periodic real-time task is to be run on a uniprocessor 1 point
Tasks using a rate monotonic scheduler. For the task to run without missing any
Lecture 14 : deadlines, what should be the maximum processor utilization due the task?
Solution to
Priority 1
Inversion 0.88
Problem
0.82
Lecture 15 : 0.76
Highest Locker
Protocol No, the answer is incorrect.
Feedback for
Score: 0
Week 3 Accepted Answers:
Quiz :
1
Assignment 3
3) Consider a periodic task set whose characteristics are shown in the 1 point
Week 3 Lecture following table. Would this task set be schedulable on a uniprocessor under
Material rate monotonic scheduling based on the Liu-Layland criterion for determining
Assignment-3
schedulability?
Solutions Task Set (All data in milliseconds)

Week 4 Task Execution Time Period Deadline

Task1 20 100 100

DOWNLOAD
VIDEOS Task2 25 150 150

Task3 40 400 400

Not likely to be schedulable but no guarantee can be given

https://onlinecourses.nptel.ac.in/noc18_cs12/unit?unit=7&assessment=42 1/4
16/05/2018 Real Time Operating System - - Unit 4 - Week 3

Likely to be schedulable but no guarantee can be given

Guaranteed to be schedulable
Guaranteed to be unschedulable
No, the answer is incorrect.
Score: 0
Accepted Answers:
Guaranteed to be schedulable
4) 4. Consider a set of three periodic real-time tasks that are to be run 1 point
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 Task1?
Task Set (All data in milliseconds)

Task Phase Execution Time Period Deadline

Task1 200 20 100 100

Task2 150 25 150 150

Task3 100 20 50 50

20 milliseconds
40 milliseconds
60 milliseconds
70 milliseconds
No, the answer is incorrect.
Score: 0
Accepted Answers:
60 milliseconds
5) Consider an application in which a set of periodic real-time tasks 1 point
share a set of non-preemptable resources and are scheduled using a rate
monotonic scheduler. Which one of the following problems cannot be
completely prevented even when choice can be made from any of the
available resource sharing protocols?

Deadlock
Chain blocking
Priority inversion
Unbounded priority inversion
No, the answer is incorrect.
Score: 0
Accepted Answers:
Priority inversion
6) Which one of the following is the closest definition of a critical 1 point
section?

A piece of code in which a shared non-preemptable resource is

accessed by a task
Any non-preemptable resource
Any  shared non-preemptable resource
A piece of code in which a shared serially-preemptable resource is
accessed by a task
No, the answer is incorrect.
Score: 0
Accepted Answers:
A piece of code in which a shared non-preemptable resource is accessed by a
task

https://onlinecourses.nptel.ac.in/noc18_cs12/unit?unit=7&assessment=42 2/4
16/05/2018 Real Time Operating System - - Unit 4 - Week 3
7) Consider an application in which a set of periodic real-time tasks 1 point
share a set of non-preeemptable resources and are scheduled using a rate
monotonic scheduler incorporating the basic priority inheritance protocol.
Which one of the following problems cannot occur in this situation?

Deadlock
Chain blocking
Priority inversion
Unbounded priority inversion
No, the answer is incorrect.
Score: 0
Accepted Answers:
Unbounded priority inversion
8) Assume that four periodic real-time tasks T1, T2, T3, and T4 share three non- 1 point
preemptable resources R1, R2, and R3 as shown in the following diagram. The
time for which each task needs a resource is annotated on the arrow connecting the task
to the corresponding resource. The tasks are arranged in decreasing order of their
priorities, with T1 being the highest priority task and T4 the lowest priority task. The tasks
are scheduled using a rate monotonic scheduler incorporating the basic priority
inheritance protocol. Which tasks would undergo direct blocking?

T1, T2, and T4

T1 and T2
T2 and T4
T2 only
No, the answer is incorrect.
Score: 0
Accepted Answers:
T1 and T2
9) Assume that four periodic real-time tasks T1, T2, T3, and T4 share three non- 1 point
preemptable resources R1, R2, and R3 as shown in the following diagram. The
time for which each task needs a resource is annotated on the arrow connecting the task
to the corresponding resource. The tasks are arranged in decreasing order of their
priorities, with T1 being the highest priority task and T4 the lowest priority task. The tasks
are scheduled using a rate monotonic scheduler incorporating the basic priority
inheritance protocol. What is the maximum duration for which the Task T2 would undergo
direct blocking?

5 units
2 units
10 units
It does not undergo any direct inversion

https://onlinecourses.nptel.ac.in/noc18_cs12/unit?unit=7&assessment=42 3/4
16/05/2018 Real Time Operating System - - Unit 4 - Week 3
No, the answer is incorrect.
Score: 0
Accepted Answers:
10 units

10)Assume that four periodic real-time tasks T1, T2, T3, and T4 share three non- 1 point
preemptable resources R1, R2, and R3 as shown in the following diagram. The
time for which each task needs a resource is annotated on the arrow connecting the task
to the corresponding resource. The tasks are arranged in decreasing order of their
priorities, with T1 being the highest priority task and T4 the lowest priority task. The tasks
are scheduled using a rate monotonic scheduler with the basic priority inheritance
protocol. The task T3 would undergo inheritance blocking due to which tasks?

T1
T2
T4
Both T2 and T4
No, the answer is incorrect.
Score: 0
Accepted Answers:
T4

Previous Page End

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

A project of In association with

Funded by

Powered by

https://onlinecourses.nptel.ac.in/noc18_cs12/unit?unit=7&assessment=42 4/4