Q.1: Illustrate (draw) how CPU switch from process to another. Use two processes and show the advantages and disadvantages of context switching on the figure? Discuss your answer? Q.2: Show how the Bounded-waiting Mutual Exclusion with test_and_set algorithm meets all critical section requirements? Q.3: Compute the (1) average turnaround time, (2) average waiting time, and (3) average response time when executing five processes with arrival time, CPU burst time, and priority information given according to the following table: Process Arrival Time Burst Time Priority P1 17 1 P2 1 7 4 P3 2 3 2 P4 3 14 Ps 4 2 3 Compute the previously mentioned performance measurements in the following cases if possible: a) Using FCFS scheduling (consider Preemptive and non-Preemptive execution). b) Using SJF scheduling (consider Preemptive and non-Preemptive execution). c) Using Priority scheduling (consider Preemptive and non-Preemptive execution). d) Using RR scheduling when quantum equals "5" (consider Preemptive and non- Preemptive execution).
Q.1: Illustrate (draw) how CPU switch from process to another. Use two processes and show the advantages and disadvantages of context switching on the figure? Discuss your answer? Q.2: Show how the Bounded-waiting Mutual Exclusion with test_and_set algorithm meets all critical section requirements? Q.3: Compute the (1) average turnaround time, (2) average waiting time, and (3) average response time when executing five processes with arrival time, CPU burst time, and priority information given according to the following table: Process Arrival Time Burst Time Priority P1 17 1 P2 1 7 4 P3 2 3 2 P4 3 14 Ps 4 2 3 Compute the previously mentioned performance measurements in the following cases if possible: a) Using FCFS scheduling (consider Preemptive and non-Preemptive execution). b) Using SJF scheduling (consider Preemptive and non-Preemptive execution). c) Using Priority scheduling (consider Preemptive and non-Preemptive execution). d) Using RR scheduling when quantum equals "5" (consider Preemptive and non- Preemptive execution).
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...
Related questions
Question
i need the answer quickly
Transcribed Image Text:Q.1: Illustrate (draw) how CPU switch from process to another. Use two processes and
show the advantages and disadvantages of context switching on the figure? Discuss your
answer?
Q.2: Show how the Bounded-waiting Mutual Exclusion with test_and_set algorithm
meets all critical section requirements?
Q.3: Compute the (1) average turnaround time, (2) average waiting time, and (3) average
response time when executing five processes with arrival time, CPU burst time, and
priority information given according to the following table:
Process
Arrival Time
Burst Time
Priority
P1
17
P2
1
7
4
P3
2
3
Pa
3
14
Ps
4
2
3
Compute the previously mentioned performance measurements in the following cases if
possible:
a) Using FCFS scheduling (consider Preemptive and non-Preemptive execution).
b) Using SJF scheduling (consider Preemptive and non-Preemptive execution).
c) Using Priority scheduling (consider Preemptive and non-Preemptive execution).
d) Using RR scheduling when quantum equals "5" (consider Preemptive and non-
Preemptive execution).
Q.4: Design a multilevel queue that satisfies the following requirements:
a) uses time quantum that equals 10 to complete short burst time (<10) first.
b) Prevent starvation of long-burst-time tasks (>10); i.e., use aging technique.
Discuss how your design works through an example you suggest?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 6 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY