Operating System b) Compute the following using Shortest Remaining Time:i.Response timeii. ThroughputiIi.Average waiting timeiv.Average turn-around time 2. Assume there are 6 processes with id, arrival time and burst time as shown below (seeTable 2).Table 2Process IDArrival TimeBurst TimeP14P213P32P443P52P661a) Based on the above information, Draw a Gantt chart for the following algorithms:i.Round-Robin (Time Quantum: 3 milliseconds)ii.Shortest Remaining Time (SRT)i.First-come-First Serve (FCFS)iv.Shortest Job First (SJF)

Solution: Given, a) i) Round Robin(RR): Grant Chart: Job Arrival Time…

Answered: 2. Assume there are 6 processes with…

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

Consider the following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to make a Gantt chart.
Consider the following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to compute for the waiting times for each process.
Consider the following set of processes, with the length of the CPU burst given in milliseconds Draw the Gantt Chart and calculate the Waiting time and the turnaround time. Upload the solution as a file
please answer b Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 5 4 P2 3 1 P3 1 2 P4 7 2 P5 4 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. b.What is the turnaround time of each process for SJF and RR algorithms?
Consider a program that performs the following steps repeatedly: Use the CPU for 4 milliseconds. By issuing an I/O, use the disk for 14 milliseconds. Use the CPU for 10 milliseconds. By issuing an I/O, use network for 18 milliseconds. Assume that each step depends on data obtained from the previous step (e.g., step 3 cannot start before step 2 is completed. Also assume that each resource (CPU or disk or network) can be used by one process at a time. Answer the following questions: (a) Draw 3 time-line diagrams (horizontal axis is the time line; one line for each resource. That is, 3 parallel rows in the resulted figure.) that illustrate the utilizations of the CPU, disk, and network over the execution of two iterations of the program above by a single process. (b) What are the average utilizations of the CPU, disk and network over these two iterations? (Please note that the “total time” should be the same across all resources, from the entire system starts until all work on any…
Given below are the arrival and burst times of four processes P1, P2, P3 and P4. Using SJF preemptive and RR scheduling (Quantum = 5ms, no priority based preemption). PROCESS NO Arrival time (msec) Burst time(msec) P1 2 7 P2 3 3 P3 4 5 P4 6 6 Write a program to calculate the average waiting time, average turnaround time, average response time, throughput, and CPU utilization. For what percentage of does the CPU remain idle?
Given below are the arrival and burst times of four processes P1, P2, P3 and P4. Using SJF preemptive and RR scheduling (Quantum = 5ms, no priority based preemption). PROCESS NO Arrival time (msec) Burst time(msec) P1 2 7 P2 3 3 P3 4 5 P4 6 6 Write a program to calculate the average waiting time, average turnaround time, average response time, throughput, and CPU utilization. For what percentage of does the CPU remain idle? C Language code
Consider the following set of four processes. Their arrival time and time to require completing the execution are given in the following table. Consider all times in milliseconds. Implement the SJF algorithm on given chart. Process Arrival Time (T0) Time required for completion (CPU Burst Time) P0 0 10 P1 1 6 P2 3 2 P3 5 4
Consider the FIVE (5)process with their CPU burst time and arrival time. Process Arrival Time CPU burst time P0 0 1 P1 2 3 P2 1 4 P3 1 3 P4 3 2 Based on the above data, answer the following Calculate the turn-around time for SRT algorithm. Calculate average turn-around time for SRT algorithm. Calculate the response time for SJF. Calculate the waiting time for SJF. Which algorithm is the best among SJF and SRT? Justify your answer.
Question no 2: Consider the following set of four processes. Their arrival time and time to require completing the execution are given in the following table. Consider all times in milliseconds. Implement the SJF algorithm on the given chart. Process Arrival Time (T0) Time required for completion (CPU Burst Time) P0 0 10 P1 1 6 P2 3 2 P3 5 4
Consider the processes with given arrival times, burst times and priorities as below Process Arrival time Burst time Priority P0 0 10 3 P1 0 5 5 P2 10 10 2 P3 10 1 1 Assume the OS is using the following CPU scheduling algorithms. (a) FIFO (b) Round Robin with quantum = 5 ms (c) Priority scheduling Calculate the waiting and turnaround times for each process for each of the algorithms above. Provide the Gantt charts in your answers for each of the algorithms to show the execution of the processes. Fill in the columns in the format below for the waiting time and turnaround time Turnaround time and waiting time Process ID Waiting Time Turnaround Time P1 P2 P3 P4 Average waiting time = Average turnaround time =
Consider the following four processes with the length of CPU burst time in milliseconds (P1: 20, P2:15, P3:10, P4:5 ms). Calculate the average waiting time by using following algorithms FCFS ALGORITHM. 1. RR ROUND ROBIN (TIME QUANTUM 10 MS)

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