1. Consider the following task set scheduled according to the rate monotonic assignment and answer the questions accordingly. (a) is the schedule feasible? T1=(1, 0.5), T2= (1.5, 0.4) (b) Do these tasks fully utilize the processor (based on RM scheduling)? Show your answer. (c) (if the answer to (b) is "no",) Change the run time of the first task so that the resulting set will maximize the utilization of the processor under RM scheduling. (d) What is the maximum achievable utilization if the period for the second task was changed from 1.5 to 2 (and the run times could also be modified to achieve maximum utilization)?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
1.
Consider the following task set scheduled according to the rate monotonic assignment and
answer the questions accordingly.
T1-(1, 0.5), T2= (1.5, 0.4)
(a) Is the schedule feasible?
(b) Do these tasks fully utilize the processor (based on RM scheduling)? Show your answer.
(c) (if the answer to (b) is “no",) Change the run time of the first task so that the resulting set will
maximize the utilization of the processor under RM scheduling.
(d) What is the maximum achievable utilization if the period for the second task was changed from
1.5 to 2 (and the run times could also be modified to achieve maximum utilization)?
Transcribed Image Text:1. Consider the following task set scheduled according to the rate monotonic assignment and answer the questions accordingly. T1-(1, 0.5), T2= (1.5, 0.4) (a) Is the schedule feasible? (b) Do these tasks fully utilize the processor (based on RM scheduling)? Show your answer. (c) (if the answer to (b) is “no",) Change the run time of the first task so that the resulting set will maximize the utilization of the processor under RM scheduling. (d) What is the maximum achievable utilization if the period for the second task was changed from 1.5 to 2 (and the run times could also be modified to achieve maximum utilization)?
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY