Can you help me with question 7 Consider the following set of processes with their arrival times and burst times:Process ID | Arrival Time | Burst TimeP1 0 5P2|1|3P3 2 8P4 3 6Using Round Robin scheduling with a time quantum of 4 units, calculate theturnaround time and waiting time for each process. Show your calculations.

To calculate turnaround time and waiting time for each process using Round Robin scheduling with a…

Answered: Consider the following set of processes…

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

Similar questions

Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1 0.0 9 P2 0.4 6. P3 0.6 4 P4 1.0 2 What is the average turnaround time for these processes with the FCFS scheduling algorithm? What is the average turnaround time for these processes with the SJF scheduling algorithm? The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not know that three shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1, P2, P3 are waiting during this idle time, so their waiting time may increase.
If priorities range from 63 (low) to 0 (high), we could increase the priority of a waiting process by 1 every 15 minutes. Eventually, even a process with an initial priority of 63 would have the highest priority in the system and would be executed. In fact, it would take no more than hours for a priority-63 process to age to a priority-0 process.
Real-time scheduling: In a system consisting of two processes, P1 and P2, suppose process P1 has a period p1 of 50, an execution time t1 of 25, and a deadline that matches its period (50). Further, suppose that P2 has a period p2 of 75, an execution time t2 of 30, and a deadline that matches its period (75). Is this real-time system schedulable under rate-monotonic scheduling? Explain your answer using the concept of overall CPU utilization and schedulability.
Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time. Process ID Arrival Time Burst Time P1 P2 P3 P4 P5 0 5 12 2 9 11 28 2 10 16 Priority 2 0 3 1 4 The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is
An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes: Process Execution time Arrival time P1 20 P2 25 15 P3 10 30 P4 15 45 What is the total waiting time for process P2?
To not let any process wait longer than 500 ms, a system developer programs the Round Robin procedure with a dynamic time quantum size. With ‘n’ processes ready, the time quantum Q is set to 500 ms/n. What do you think of this scheduling strategy? (In which situations is this strategy feasible, and when is it not? Are there edge cases?) Explain your reasoning.
Consider the following processes with their arrival times and burst times: Process Arrival time Burst time P1 8 1 P2 5 1 P3 2 7 P4 4 3 P5 2 8 P6 4 2 P7 3 5 Draw two Gantt charts illustrating the execution of these processes using SJF-non-preemptive and SJF-preemptive scheduling algorithm. Draw Gantt Chart of RR with Time Quantum of 2. Calculate Average waiting time and which of the schedules above results in the minimal average waiting time (over all processes)?
You are designing a real-time system that must execute the following set of processes: P1(20,3); P2(5,2); P3(350,15); P4(500,22); P5(100,10) Note: The first parameter listed for each process is the period, and the second is the maximum execution time. Can these processes be scheduled using Rate Monotonic? You must justify your answer. Can these processes be scheduled using Earliest Deadline First? You must justify your answer. If possible, identify the simplest of these strategies that can be used to schedule these processes.
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1 0.0 P2 0.4 P3 0.6 4 P4 1.0 2 a) What is the average turnaround time for these processes with the FCFS scheduling algorithm? b) What is the average turnaround time for these processes with the SJF scheduling algorithm? c) The SJF algorithm is supposed to improve performanee, but notice that we chose to run process P1 at time 0 because we did not know that three shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1, P2, P3 are waiting during this idle time, so their waiting time may increase.
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Arrival Time Burst time P1 7 P2 4 P3 1 P4 4 P5 3 4 1) Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 1) scheduling. 2) What is the turnaround time of each process for each of the scheduling algorithms? 3) What is the waiting time of each process for each of the scheduling algorithms? 4) Which of the schedules results in the minimal average waiting time (over all processes)? O2445
Consider the following set of processes, with the arrival times and the CPU-burst times given in milliseconds Process Arrival Time Burst Time P1 5 P2 1 3 P3 3 P4 4 1 What is the average turnaround time for these processes with the preemptive shortest remaining processing time first (SRPT) algorithm ?
Consider the following set of processes: Process Arrival Burst P1 00 7 P2 2 4 P3 4 2 P4 6 2 Draw two Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, preemptive SJF. Find the average waiting time for FCFS only.

SEE MORE QUESTIONS

Recommended textbooks for you

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)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

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)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

Consider the following set of processes with their arrival times and burst times: Process ID | Arrival Time | Burst Time P1 0 5 P2|1|3 P3 2 8 P4 3 6 Using Round Robin scheduling with a time quantum of 4 units, calculate the turnaround time and waiting time for each process. Show your calculations.