HomeworkLib
Question

Suppose there are 4 processes P1, P2, P3 and P4 getting to ready queue in various...

Suppose there are 4 processes P1, P2, P3 and P4 getting to ready queue in various arrival times and with various bursts times as detailed in the table below. Using Shortest-remaining-time-first scheduling approach, find waiting time for each process and the average waiting time and provide detailed steps taken to find the answer. Using time quantum of milliseconds.

Process

Arrival time (ms)

Burst Time (ms)

P1

0

8

P2

2

3

P3

6

2

P4

9

7

Explain Peterson’s solution for critical-section problem and show that mutual exclusion is preserved with Peterson’s solution. (Assume there are only two processes P0 and P1)

** please no handwrite **

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

my laptop present not in proper condition

So I will wrote on paper

For Peterson's solution those code will be sufficient

Explanation in paper is not possible

Anything doubtful or not understand or missing just comment

Don't be dislike

Thank you and all the best

0 0
Add a comment
Know the answer?
Add Answer to:
Suppose there are 4 processes P1, P2, P3 and P4 getting to ready queue in various...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 4. Consider a ready queue with four processes :- Process Arrival Time Burst Time (ms) P1...

    4. Consider a ready queue with four processes :- Process Arrival Time Burst Time (ms) P1 Priority P2 P3 P4 P5 For each of the following CPU scheduling algorithms, determine the turnaround and average waiting time for each of the process :- a. Shortest remaining Time First b. Shortest Job First C. Priority Scheduling (Both pre-emptive and non-preemptive) d. Round Robin (quantum is 1 ms)

  • Need the process that how we get P2 P1 P4 P3 and waiting time please 1....

    Need the process that how we get P2 P1 P4 P3 and waiting time please 1. Draw a Gantt chart below similar to the ones from lecture that illustrates the execution of the processes using the shortest-job-first CPU scheduling algorithm. Process Arrival Burst | Time Time P. 7 ms 2 ms | P2 Oms 8 ms 11 ms 5 ms P4 4 ms 9 ms P2 P2 P4 P3 oms 8 10 19 24 | Using the chart you drew,...

  • luuent Name: 1. (100 points) Three processes P1, P2 and P3 with related information are given...

    luuent Name: 1. (100 points) Three processes P1, P2 and P3 with related information are given in the following table: Process Burst Time (ms) Arrival Time (ms) P1 T 0 P2 30 20 P3 20 T is a positive integer (T>0). Please use a non-preemptive shortest job first scheduling algorithm to make Gantt charts, and calculate different waiting times of three processes for different cases. Please write a professional perfect solution with detailed steps. 30

  • Three processes P1, P2 and P3 with related information are given in the following table: Process...

    Three processes P1, P2 and P3 with related information are given in the following table: Process Burst Time (ms) Arrival Time(ms) P1400 P2 3 0 10 P3 L T 20 T is a positive integer (T>0). If you use a preemptive shortest job first scheduling algorithm to schedule the three processes, make a Gantt chart, and calculate different waiting times of three processes. Please show a professional perfect solution with necessary details.

  • The following processes P1, P2, P3, P4 and P5 arrive at the same time (t =...

    The following processes P1, P2, P3, P4 and P5 arrive at the same time (t = 0). Establish a timeline of the process scheduling for the following scheduling algorithms while also identifying start times for each process. FCFS (first come, first serve; assume order of P1, P2, P3, P4 and P5) SJF (shortest job first) Priority iv Round Robin (quantum = 1, assume order of P1, P2, P3, P4 and P5) Determine the average waiting time for each algorithm.

  • The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5, P6 and P7 all at time 0.

    Table 1 shows the list of processes and burst time for each processesTable 1 ProcessBurst TimeP113P25P323P43P531P66P714 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5, P6 and P7 all at  time 0. a)    Calculate the average waiting time when each of the below scheduling algorithm is used. Assume that a quantum 8 is being used:i.) First Come, First Server                                                                      (6 marks)ii.) Round Robin                                                                                       (6 marks)iii.) Shortest Job First, non preemptive                                                      (6 marks)

  • Five processes p1,p2,p3,p4,p5 arrive at time 0 simultaneously. their cpu burst are 12,6,5,6, and 8 respectively....

    Five processes p1,p2,p3,p4,p5 arrive at time 0 simultaneously. their cpu burst are 12,6,5,6, and 8 respectively. 1.) Uses Shortest job first to calculate the waiting time of each process b.) calculate the average waiting time

  • Part 2 Round Robin Scheduling Process Burst Time in Ms P1 4 P2 2 P3 1...

    Part 2 Round Robin Scheduling Process Burst Time in Ms P1 4 P2 2 P3 1 Calculate the average waiting time and turnaround time using round robin scheduling, where the time quantum q = 2 ms According to the Round Robin algorithm, the arrival of processes is shown in the following Gantt chart. P1 P2 P3 P1 P2 P3 P1 P2 P3 P1 0                 2                 4                  6                8                 10               12                14               15              16               18...

  • Given the following set of processes with corresponding execution times (in ms), arrival times and priority...

    Given the following set of processes with corresponding execution times (in ms), arrival times and priority (1 – highest).  For each scheduling algorithm: Construct a table showing which process is active and for how long until all processes are completely serviced (as done in class). Calculate the average waiting time and turnaround time. Process ID Burst (ms) Arrival time P1 9 0 P2 12 0 P3 3 0 P4 30 0 P5 20 0 P6 10 0 First Come First Serve...

  • Assume that the three processes arrived in order: Processes                            CPU Burst Time P1  &n

    Assume that the three processes arrived in order: Processes                            CPU Burst Time P1                                           17 P2                                            6 P3                                            8 a.     Please draw the Gantt chart if FCFS scheduling is used. b.    Please calculate the average waiting time and average completion time under FCFS. You MUST show the calculation procedure. c.      Please draw the Gantt chart if Round Robin is used. d.    Please calculate the average waiting time and completion time under RR with q = 3. You MUST show the calculation...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT