Use the following table of processes and burst time to answer the questions P3 P4 P5 Process Burst time PI P2 120 60 180 50 300 1) Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 50) 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)?

Use the following table of processes and burst time to answer the questions P3 P4 P5 Process Burst time PI P2 120 60 180 50 300 1) Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 50) 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)?

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

Note: this question is related from operating system subject. Q:By Round Robin (time quantum= 3) show the scheduling order of the processes using a Gantt chart in the following data. Also b) What is the turnaround time for each process? c) What is the waiting time for each process? d) What is the response time for each process? Process Burst Arrival P1 30 0 P2 25 40 P3 20 50 P4 12 75
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 nonpreemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time Pl 0.0 8 P2 0.4 4 P3 1.0 1 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 performance, but notice that we chose to run process P1 at time 0 because we did not k11ow that two 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 and P2 are waiting during this idle time, so their waiting time may increase. This algorithm could be known as future-knowledge…
Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst time Arrival time P1 10 1 P2 04 2 P3 05 3 P4 03 4 Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF preemptive and Round Robin (quantum = 3). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? Which of the algorithms results in the minimum average turnaround time (over all processes)?
Consider the following five processes each having its own unique execution time and arrival time Process Arrival Time Execution Time A 0 6 B 3 2 C 5 4 D 7 6 E 10 3 Draw a timeline and compute the average turnaround time and average waiting time for reach of the scheduling algorithms below: 1.FCFS 2.Round Robin (time slice = 3) 3. SRT 4. SJF
USE GANTT CHART FOR SHOWING SOLUTION SEE NEXT IMAGE FOR THE EXAMPLE OF NEEDED SOLUTION Given the process stream: Process Arrival Time Burst Time Memory Size A 0 6 9K B 1 8 5K C 2 4 8K D 3 5 7K Assume: Partition: 12:6:6:6 CPU Scheduling – Shortest Job First Job Selection Algorithm – First Fit Compute IF, EF, and % MU. Process Time the Process Starts Processing Time the Process Ends Internal Fragmentation at this Time External Fragmentation at this Time % Memory Utilization In What Partition Will the Process Be Allocated? A B C D
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 =
Six batch jobs arrive almost at the same time in the following order: p1;p2; : : : ;p6. The table below contains their running times and priorities: Job p1 p2 p3 p4 p5 p6Running time (in min) 8 1 5 3 7 4Priority 3 2 5 1 4 6 The highest priority is 6. For each of the following scheduling algorithms, determine the order of execution of processes and mean process turnaround time:(a) priority scheduling;(b) rst-come, rst-served;(c) shortest job rst.Scheduling is non-preemptive.
2. Consider the following processes with their associated CPU burst times. The processes have entered the system in the order that they are presented in the table. Process : BurstTime P1 : 7 P2 : 1 P3 : 13 P4 : 4 P5 : 5 For each of the following scheduling algorithms, draw a Gantt chart that illustrates the order of execution for each of these processes. Also, compute the average waiting time for each algorithm. a. First Come First Served b. Shortest Job First c. Round Robin (with time quantum of 3)
Given the following table, how will these processes be scheduled using RR algorithm with quantum = 10 ms and context switch time = 2 ms ? Create a Gantt chart showing when each process will be scheduled, and calculate the average waiting time, turnaround time and CPU utilization.
1. 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 scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst TimeP1 0 8P2 4 4P3 10 1a. Draw the Gantt chart for the above using FCFS scheduling algorithm b. Draw the Gantt chart for the above using SJF non-preemptive scheduling algorithm. c. What is the average waiting time for these processes with the FCFS scheduling and SJF non-preemptive algorithms? d. What are the 2 major activities of an operating system with regards to process management? e. Which of the following instructions should be privileged? Read the clock.Clear memory. f. What is the purpose of system…
Consider the following data [Figure].Suppose round robin scheduling is applied on the given data with time quantum=Floor (XX % 3) units. It is also given that scheduling of a process or context switch will take 1 unit of time. What is the completion time and turnaround time of process P4?Where XX is the last two digits of your roll number. XX=18
Question 4 Execute SRT for the following group of processes and complete the following table: Process A B C D E TArrival 0 2 4 6 8 Ts 2 3 5 1 4 TFinish Answer Answer Answer Answer Answer TR Answer Â Answer Â Answer Â Answer Â Answer Â 1. If the process arriving has the same remaining execution time as the process in the CPU, then the process that is using the CPU will have the highest priority.Â 2. If there is no process in the execution state and two or more processes have the shortest remaining time, then you will use the lowest PID criterion (using lexicographical order). Question 5 Execute HRRN for the following group of processes and complete the following table: Process A B C D TArrival 0 2 4 6 Ts 3 5 4 1 TFinish Answer Answer Answer Answer TR Answer Â Answer Answer Answer Â If two or more processes in the ready queue…