ZuoTi.Pro
Question

consider the following processes: process:       p1 p2 p3 p4 p5 Arrival time: 0   1   3   4  ...

consider the following processes:

process:       p1 p2 p3 p4 p5
Arrival time: 0   1   3   4   5
CPU time:     5   4   2   3   2

draw a timing graph that shows when each process executes under SJF(shortest job first) and another graph for SRT(shortest remaining time).

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

Homework Answers

Answer #1

Shortest Job First Algorithm:

Shortest Job First algorithm is a CPU scheduling algorithm, in which the process which has the smallest burst time is allocated to the CPU first. If the burst time of the two processes is the same then the First Come First Serve algorithm is used to break the tie.

The timing graph is given below:

Shortest Remaining Time First Algorithm:

Shortest Remaining Time algorithm is a CPU scheduling algorithm, in which the process which has the smallest remaining burst time is allocated to the CPU first. If the burst time of the two processes is the same then the First Come First Serve algorithm is used to break the tie.

The timing graph is given below:

0 0
Add a comment
Know the answer?
Add Answer to:
consider the following processes: process:       p1 p2 p3 p4 p5 Arrival time: 0   1   3   4  ...
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

  • Consider the following 5 processes Process Arrival Time CPU Burst Time 0 3 2 6 P2...

    Consider the following 5 processes Process Arrival Time CPU Burst Time 0 3 2 6 P2 4 4 6 5 P4 2 Ps (a) Draw a timing diagram showing when each process executes under FIFO, SJF, and SRT (b) Determine the Average Turnaround Time (ATT) for each scheduling algorithm for the 5 processes

  • 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.

  • 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)

  • 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

  • process Arrival Time Burst Time P1 0 10 P2 2 7 P3 4 4 P4 5...

    process Arrival Time Burst Time P1 0 10 P2 2 7 P3 4 4 P4 5 2 P5 6 1 I need the solution on non-preemptive SJF & Preemptive SJF the Gantt Chart , Wating time and Average Wating time becouse I am really confused :(

  • 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)

  • 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,...

  • Consider 5 processes whose Arrival time and CPU Burst time is as follows (Process no: Arrival...

    Consider 5 processes whose Arrival time and CPU Burst time is as follows (Process no: Arrival time: Burst time): P1:0,6 P2:2,4 P3:3,2 P4: 5,5 P5: 6,9 Assume that the processes are scheduled using SJF (Non-preemptive) scheduling algorithm. The average waiting and turaround time is O 5.45, 11.60 O 5.40, 10.60 O 6.50, 10.99 O 5.45, 11.60

  • OS CPU Scheduling 1. Given the following processes Process Arrival Time 0 Priority 5 P1 P2...

    OS CPU Scheduling 1. Given the following processes Process Arrival Time 0 Priority 5 P1 P2 P3 P4 Burst Time 10 5 8 15 2 2 3 2 a) Please demonstrate the SJF and LJF algorithms on the above. (Note: if they mention SJF or any other, make sure u do both the non- preemptive and preemptive) b) What are the differences between them?

  • 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...

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
ADVERTISEMENT