1. Given the following processes, burst times and arrival time in Table1: Table 1: List of Process with Burst Time and Arrival Time Process P1 P2 P3 P4 P5 Burst Time 4 3 2 1 3 Arrival Time 3 5 0 5 4 The processes are assumed to have arrived based on the arrival time a) Calculate the average waiting time when each of the below scheduling algorith used. i.) First Come, First Serve

1. Given the following processes, burst times and arrival time in Table1: Table 1: List of Process with Burst Time and Arrival Time Process P1 P2 P3 P4 P5 Burst Time 4 3 2 1 3 Arrival Time 3 5 0 5 4 The processes are assumed to have arrived based on the arrival time a) Calculate the average waiting time when each of the below scheduling algorith used. i.) First Come, First Serve

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

At times t = 0, 1, and 2 seconds, processes P1, P2, and P3 arrive in the Ready state, respectively. Suppose their execution times are 5 seconds, 4 seconds, and 3 seconds, respectively. Show how they will be scheduled using round robin scheduling with a quantum of 3 seconds. Calculate the average turnaround time per process.
Consider the following set of processes, with the length of the CPU burst and I/O burst given in milliseconds: Process CPU, I/O, CPU Arrival time P1 2, 3, 1 0 P2 2, 1, 4 4 P3 1, 1, 4 10 P4 6, 6, 6 13 For example: In FCFS a process p1 arrived at 0 ms gets CPU for 2 ms, then releases CPU to the next process for 3ms where it performs I/O burst and return back to the queue with a new arrival time as (2+3 = 5ms) 5 ms. In case of a tie, go with process number. Perform the following for FCFS and non-preemptive SJF scheduling algorithm: Calculate the average waiting time, average turnaround time. With respect to each metric justify which scheduling algorithm is good for the given process mix.
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 following set of processes (a smaller priority number implies a higher priority). The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Process Priority Burst Time P1 1 20 P2 3 25 P3 4 25 P4 2 15 P5 5 30 Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF (if two jobs have the same burst time, schedule them following priority), and non-preemptive priority.
Consider the following set of processes (a smaller priority number implies a higher priority). The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Process Priority Burst Time P1 1 20 P2 3 25 P3 4 25 P4 2 15 P5 5 30 What is the turnaround time of each process for each of the scheduling algorithms, FCFS, SJF (if two jobs have the same burst time, schedule them following priority), non-preemptive priority? Process FCFS SJF Priority P1 P2 P3 P4 P5
Consider the following set of processes, with the length of the CPU burst given in milliseconds Process Burst Time Priority P1 5 1 P2 2 3 P3 1 3 P4 1 2 P5 10 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, and RR (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 the scheduling algorithms in part a? Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider three processes (process id 0, 1, 2 respectively) with computing bursts timeunits of 3, 4 and 7 respectively. All processes arrive at the same time. Consider thescheduling algorithm with the longest remaining time first (LRTF). In LRTF ties arebroken by giving priority to the process with the lowest process id. What is theaverage waiting time for the three processes? Describe in depth.
Consider the following set of processes. Process BurstTime Priority Arrival P1 30 20 0 P2 5 25 5 P3 15 20 12 P4 10 30 48 Assume that the CPU is idle at time 0 and that processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. a.What is the turnaround time for P3? Give your answer as an integer. b. What is the waiting time for P1? Give your answer as an integer. c. Indicate whether the processes run concurrently. 1P1 and P3 2P2 and P3 3P4 and P3 d. How many times does a context switch from P1 occur? Give your answer as an integer.
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 set of processes (a smaller priority number implies a higher priority). The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Process Priority Burst Time P1 1 20 P2 3 25 P3 4 25 P4 2 15 P5 5 30 What is the waiting time of each process for each of the scheduling algorithms FCFS, SJF (if two jobs have the same burst time, schedule them following priority), non-preemptive priority? Process FCFS SJF Priority P1 P2 P3 P4 P5
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 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)?