Question

operating system question.

Problem Description Consider the following set of processes and arrival and processing time in- formation: Process Arrival Ti

Table 9.5 and figure 9.5:

D E 08 6 | 5 Mean 18 12 2.40 20 12 6.00 8.60 2.56 Table 9.5 A Comparison of Scheduling Policies Process A B C Arrival Time 0

9.2 / SCHEDULING ALGORITHMS 405 5 10 15 TILL LLL LL First-come-first served (FCFS) Round-robin (RR), q = 1 Round-robin (RR),

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Given, Process Arrival Processing Time _Time urrouw QU FCFS: AJBTC DE 0 3 8 10 15 20 Finish sich Time Turn Around 1 Wair Time

SPN: (Shortest Process Next). * Non- preemptive ale BDE 0 3 5 10 15 20 Process Arrival i Poocesso Time Time Finish | Turn Aro

Add a comment
Know the answer?
Add Answer to:
operating system question. Table 9.5 and figure 9.5: Problem Description Consider the following set of processes...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • 2- Consider the following set of processes: Arrival Time Process Service Time 10 Find the average response, wait and tu...

    2- Consider the following set of processes: Arrival Time Process Service Time 10 Find the average response, wait and turnaround times of the processes in FCFS, Round Robin (with Q-2), SPN and SRT, MLFD (with q-2') and HRRN algorithms. 2- Consider the following set of processes: Arrival Time Process Service Time 10 Find the average response, wait and turnaround times of the processes in FCFS, Round Robin (with Q-2), SPN and SRT, MLFD (with q-2') and HRRN algorithms.

  • Problem Given the arrival time, and service time for the processes A, B, C, D, E...

    Problem Given the arrival time, and service time for the processes A, B, C, D, E as below: Process A B C D E Arrival Time 0 2 4 6 8 Service Time (T.) 3 6 4 5 2 Work out the Finish Time and Turn Around Time (T.) for each of the following scheduling policies: FCFS, RR with q = 1, SJF, and SRT time Around = finish time -

  • QUESTION 1 Consider the following set of processes, with the length of the CPU burst time...

    QUESTION 1 Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process            Burst Time      Priority P1                    7                      5 P2                    2                      4 P3                    11                    3 P4                    9                      1 P5                    5                      3 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 2). b. What...

  • Please answer the following question in C++ language Consider the following set of processes, with the...

    Please answer the following question in C++ language Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process            Burst Time      Priority P1. 7 5 P2 2 4 P3 11 3 P4 9 1 P5 5 3 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive...

  • Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...

    Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process            Burst Time      Priority P1                    10                    3 P2                    1                     1 P3                    2                     3 P4                    1                     4 P5                    5                     2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF (SPN), a...

  • Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

    Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:Processburst TimePriorityP1103P211P323P414P552For each of the scheduling algorithms, FCFS, Shortest-Job-First (SJF, non-preemptive), Priority (smaller priority number implies higher scheduling priority), and RR (quantum = 1) do the following.Draw a Gantt chart to show how these processes would be scheduled.Give the turnaround time (total time from the first arrival into ready state until CPU-burst is completed) of each process.Give the waiting time (total time spent in the Ready state) of each process.Give...

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

  • Design Principles Canvas Ā 8 pts Question 35 Five batch jobs, A, B, C, D, and...

    Design Principles Canvas Ā 8 pts Question 35 Five batch jobs, A, B, C, D, and E, arrive at a computer system at time 0, 1, 2, 3, 4, respectively. And they have service time of 7.1. 3,5, and 4, respectively. The new jobs arrive a little ahead of the expiration of time slices. For each of the following scheduling algorithms, determine the turnaround time for each process for all jobs. Ignore process switching overhead. • Round robin with a...

  • QUESTION 3 Consider the following set of processes: Priority Process Arrival Time A 0 B 1...

    QUESTION 3 Consider the following set of processes: Priority Process Arrival Time A 0 B 1 C 6 * Lower number means higher priority Burst Time (ms) 5 3 4 Draw in a paper sheet 4 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Non-Preemptive SJF, Shortest-Remaining-Time-First (SRTF), Non-Preemptive Priority (NPP), and RR (quantum time = 2) scheduling algorithms, then fill the following tabic accordingly. (Note: If a new process arrives at the...

  • Consider the following set of processes, with the length of the CPU burst given in milliseconds:

    Consider the following set of processes, with the length of the CPU burst given in milliseconds:ProcessBurst TimePriorityP1 54P231P312P472P543The processes are assumed to have arrived in the order P1 , P2 , P3 , P4 , P5 , all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each...

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