Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Q1) (4 marks) In a simple priority-driven pre-emptive scheduler, three periodic tasks T1, T2, and T3 and two background (BG) tasks T4 and T5 are scheduled. The periodic task T1 has the highest priority, executes once every 20 ms, and requires 5 ms of execution time. The periodic task T2 requires 5 ms of execution time every 50 ms. The periodic task T3 requires 5 ms of execution time every 100 ms. The BG T4, and T5 each requires 100 ms of execution time. Assume all tasks start at time 0 ms. (1) Determine the time T4 and T5 will complete. (2) Draw the chart. 05 Q2) (3.5 marks) Table below shows the mapping between process requests (PO → P3) and resource allocation (A, B, and C resources). A has 5 instances, B has 1, and C has 5 instances. Allocation Request Available A B C A B C A B C PO 0 1 0 0 0 0 0 0 0 P1 2 0 0 2 0 2 P2 3 0 3 0 1 0 P3 0 0 2 0 0 2 (1) Is there a sequence for processes that will allow deadlock to be avoided? If yes, what is it? (2) If P2 increases its request for C resources by 2 more, what will the sequence be, if any?

Q1) (4 marks) In a simple priority-driven pre-emptive scheduler, three periodic tasks T1, T2, and T3 and two background (BG) tasks T4 and T5 are scheduled. The periodic task T1 has the highest priority, executes once every 20 ms, and requires 5 ms of execution time. The periodic task T2 requires 5 ms of execution time every 50 ms. The periodic task T3 requires 5 ms of execution time every 100 ms. The BG T4, and T5 each requires 100 ms of execution time. Assume all tasks start at time 0 ms. (1) Determine the time T4 and T5 will complete. (2) Draw the chart. 05 Q2) (3.5 marks) Table below shows the mapping between process requests (PO → P3) and resource allocation (A, B, and C resources). A has 5 instances, B has 1, and C has 5 instances. Allocation Request Available A B C A B C A B C PO 0 1 0 0 0 0 0 0 0 P1 2 0 0 2 0 2 P2 3 0 3 0 1 0 P3 0 0 2 0 0 2 (1) Is there a sequence for processes that will allow deadlock to be avoided? If yes, what is it? (2) If P2 increases its request for C resources by 2 more, what will the sequence be, if any?

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
Please do fast and solve both parts
Q1) (4 marks) In a simple priority-driven pre-emptive scheduler, three periodic tasks T1, T2, and T3 and two background (BG) tasks T4 and T5 are scheduled. The periodic task T1 has the highest priority, executes once every 20 ms, and requires 5 ms of execution time. The periodic task T2 requires 5 ms of execution time every 50 ms. The periodic task T3 requires 5 ms of execution time every 100 ms. The BG T4, and T5 each requires 100 ms of execution time. Assume all tasks start at time 0 ms. (1) Determine the time T4 and T5 will complete. (2) Draw the chart. 05 Q2) (3.5 marks) Table below shows the mapping between process requests (PO → P3) and resource allocation (A, B, and C resources). A has 5 instances, B has 1, and C has 5 instances. Allocation Request Available A B C A B C A B C PO 0 1 0 0 0 0 0 0 0 P1 2 0 0 2 0 2 P2 3 0 3 0 1 0 P3 0 0 2 0 0 2 (1) Is there a sequence for processes that will allow deadlock to be avoided? If yes, what is it? (2) If P2 increases its request for C resources by 2 more, what will the sequence be, if any?
Transcribed Image Text:Q1) (4 marks) In a simple priority-driven pre-emptive scheduler, three periodic tasks T1, T2, and T3 and two background (BG) tasks T4 and T5 are scheduled. The periodic task T1 has the highest priority, executes once every 20 ms, and requires 5 ms of execution time. The periodic task T2 requires 5 ms of execution time every 50 ms. The periodic task T3 requires 5 ms of execution time every 100 ms. The BG T4, and T5 each requires 100 ms of execution time. Assume all tasks start at time 0 ms. (1) Determine the time T4 and T5 will complete. (2) Draw the chart. 05 Q2) (3.5 marks) Table below shows the mapping between process requests (PO → P3) and resource allocation (A, B, and C resources). A has 5 instances, B has 1, and C has 5 instances. Allocation Request Available A B C A B C A B C PO 0 1 0 0 0 0 0 0 0 P1 2 0 0 2 0 2 P2 3 0 3 0 1 0 P3 0 0 2 0 0 2 (1) Is there a sequence for processes that will allow deadlock to be avoided? If yes, what is it? (2) If P2 increases its request for C resources by 2 more, what will the sequence be, if any?
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS