Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Size (msec) Priority Ji 10 2 (Silver) 1 (Gold) 3 (Bronze) 2 (Silver) 3 (Bronze) 1 (Gold) 2 J3 J4 Js J6 3 10 3 4 12 1 15 4 a) Draw a Gantt chart showing FCFS scheduling for these jobs and find average waiting time. b) Draw a Gantt chart showing (non-preemptive) SJF scheduling and find average waiting time c) Draw a Gantt chart showing non-preemptive PRIORITY scheduling and find average turn-around time.

Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Size (msec) Priority Ji 10 2 (Silver) 1 (Gold) 3 (Bronze) 2 (Silver) 3 (Bronze) 1 (Gold) 2 J3 J4 Js J6 3 10 3 4 12 1 15 4 a) Draw a Gantt chart showing FCFS scheduling for these jobs and find average waiting time. b) Draw a Gantt chart showing (non-preemptive) SJF scheduling and find average waiting time c) Draw a Gantt chart showing non-preemptive PRIORITY scheduling and find average turn-around time.

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 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.
Apply the following CPU scheduling algorithms and be able to compare the output based on the following parameters identified below. CPU scheduling algorithms: 1 First-Come First-Serve Scheduling, FCFS. 2 Shortest-Job-First Scheduling, SJF. 3 Priority Scheduling. 4 Round Robin Scheduling. ... Job Arrival Time Burst Time Priority J1 0 5 1 J2 1 3 2 J3 2 2 3 J4 3 6 4 J5 4 4 5 Use this parameters with each CPU scheduling: CPU utilization Throughput Turn-around time of each job Turn-around time Average Waiting time of each job Waiting time Average Response time Answer and explain the following questions: What scheduling system is the best performer? Define your parameters or attributes or basis in selecting the best performer CPU Scheduling system. What scheduling system needs enhancement/improvement. Explain the needed improvements based on your parameters/attributes/basis. What additional parameters or attributes…
1. Apply the following CPU scheduling algorithms and be able to compare the output based on the following parameters identified below: CPU Scheduling algorithms: 1 First-Come First-Serve Scheduling, FCFS. 2 Shortest-Job-First Scheduling, SJF. 3 Priority Scheduling. Jobs Arrival time Burst time Priority J1 0 5 1 J2 1 3 2 J3 2 2 3 J4 3 6 4 J5 4 4 5 Use this parameters with each CPU scheduling: CPU utilization Throughput Turn-around time of each job Turn-around time Average Waiting time of each job Waiting time Average Response time Answer and explain the following questions: What scheduling system is the best performer? Define your parameters or attributes or basis in selecting the best performer CPU Scheduling system. What scheduling system needs enhancement/improvement. Explain the needed improvements based on your parameters/attributes/basis. What additional parameters or attributes will be added to improve…
consider the following set of processes with the length of the cpu burst time in given ms: process burst time arrival time p1 8 0.00 p2 4 1.001 p3 9 2.001 p4 5 3.001 p5 3 4.001 a) draw four gantt chart illustrtaing the exaction of these processes using FCFS SJF PRIORITY and RR (quantum=2) scheduling b) also calculate waiting time and turnaround time for each scheduling algorithms
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)
1. Consider the following set of processes, with the length of the CPU burst given inmilliseconds: Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 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 thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger prioritynumber implies a higher priority), and RR (quantum = 2).b. What is the turnaround time of each process for each of the scheduling algorithms inpart a?c. What is the waiting time of each process for each of these scheduling algorithms?d. Which of the algorithms results in the minimum average waiting time (over allprocesses)?
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 the following four processes with the length of CPU burst time in milliseconds. Calculate the average waiting time using following algorithms and find which algorithms gives least average waiting time. FCFS (First Come First Served) SJF (Shortest Job First) PS (Priority Scheduling) RR (Round Robin) (Time quantum is 5 ms) Process Burst Time Priority P1 12 3 P2 6 2 P3 18 1 P4 4 4
Consider the following set of processes, the length of the CPU burst time given in milliseconds: Process Burst Time P1 6 P2 8 P2 7 P4 3 Assuming the above processes are being scheduled with the Shortest Job First (SJF) scheduling algorithm. The waiting time for process P1 is 3ms The waiting time for process P1 is 0ms The waiting time for process P1 is 16ms The waiting time for process P1 is 9ms From the following list which is the deadlock avoidance algorithm? Banker’s algorithm Round-robin algorithm Elevator algorithm Karn’s algorithm A problem encountered in multitasking when a process is perpetually denied necessary resources is called Deadlock Starvation Inversion Aging To break a deadlock: Abort one or more processes to break the circular wait Abort all the process in the system Preempt all resources from all processes None of the mentioned Termination of the process terminates First thread of the process First two threads…
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 1 3 P2 3 1 P3 2 5 P4 4 4 P5 5 2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw 2 Gantt charts that illustrate the execution of these processes using the following 2 scheduling algorithms: non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1). What is the turnaround time of each process for each of the scheduling algorithms in part a? Explain why What is the waiting time of each process for each of these scheduling algorithms?Explain why
Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5 all at time 0. a. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part i? c. Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst Priority P1 32 4 P2 24 1 P3 4 2 P4 36 2 P5 12 3 NOTE: 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, non-preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8). 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)? NOTE: Write the code of all parts