Q6 )The following processes are submitted to an operating system. They are calculation processeswhich require no input/output (i.e. they are always ready to utilize the CPU)1. Draw Gantt charts that illustrate the execution of these processes using the following schedulingalgorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptivepriority, Highest response ratio next (HRRN), and RR (quantum = 2).2.What is the average turnaround time average waiting time, schedule length, and throughputof each process for each of the scheduling algorithms in part 1?3. Which of the algorithms results in the minimum average waiting time (over all processes)? (1. FCFSPID AT BT0P18P26P3P4P5PlP2P32. Non-Preemptive SJFPID AT BT CT TAT082211933Gantt Chart:61P419P5 3 3Gantt Chart:.2.23. Preemptive SJFPIDPLP2P31P41 9PS 3 3Gantt Chart:BT0 8126AT2CT TAT WTCTΤΑΊWTWTAverage Turnaround Time-Average Waiting time =Schedule Length-Throughtput-.Average Turnaround Time=Average Waiting timeSchedule Length=ThroughputAverage Turnaround Time. Average Waiting time-Schedule Length=Throughtpat

1.FCFS NON-PREEMTIVE: Which means that if the process get started for execution it never ended until…

Q6 )The following processes are submitted to an operating system. They are calculation processes which require no input/output (i.e. they are always ready to utilize the CPU) 1. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptive priority, Highest response ratio next (HRRN), and RR (quantum-2). 2. What is the average turnaround time average waiting time, schedule length, and throughput of each process for each of the scheduling algorithms in part 17 3. Which of the algorithms results in the minimum average waiting time (over all processes)? ( 1. FCFS PID AT BT PI 0 S P2 2 . P3 P4 P5 . 2 P3 2 P4 1 PS 3 2 1 3 Gantt Chart: 2. Non-Preemptive SJF PID AT BT CT TAT WT 0 S Pl P2 6 HERREX PID AT PI 0 3 Gantt Chart: . P2 2 61 3. Preemptive SJF P3 2 P4 1 PS 3 9 6 1 BT 8 6 1 9 3 9 3 Gantt Chart: CT TAT WT CT TAT WT . . Average Turnaround Time- Average Waiting time => Schedule Length- Throughtput- Average Turnaround Time= Average Waiting time - Schedule Length= Throughput Average Turnaround Time Average Waiting time- Schedule Length Throughtpat-

Q6 )The following processes are submitted to an operating system. They are calculation processes which require no input/output (i.e. they are always ready to utilize the CPU) 1. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptive priority, Highest response ratio next (HRRN), and RR (quantum-2). 2. What is the average turnaround time average waiting time, schedule length, and throughput of each process for each of the scheduling algorithms in part 17 3. Which of the algorithms results in the minimum average waiting time (over all processes)? ( 1. FCFS PID AT BT PI 0 S P2 2 . P3 P4 P5 . 2 P3 2 P4 1 PS 3 2 1 3 Gantt Chart: 2. Non-Preemptive SJF PID AT BT CT TAT WT 0 S Pl P2 6 HERREX PID AT PI 0 3 Gantt Chart: . P2 2 61 3. Preemptive SJF P3 2 P4 1 PS 3 9 6 1 BT 8 6 1 9 3 9 3 Gantt Chart: CT TAT WT CT TAT WT . . Average Turnaround Time- Average Waiting time => Schedule Length- Throughtput- Average Turnaround Time= Average Waiting time - Schedule Length= Throughput Average Turnaround Time Average Waiting time- Schedule Length Throughtpat-

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

1. Write a LINUX C code for Banker’s Algorithm to deadlock avoidance.Note: Consider a system with five processes (P0–P4) and three resources (A, B, C). There are 9 instances of resource type A, 4 instances of resource type B, and 6 instances of resource type C
114. All deadlocks involve conflicting needs for a. Resources b. Users c. Computers d. Programs
Assume that the following processes are the only processes in a computer system and that there are no input/output requests from all the given processes. Given the following arrival time and CPU burst time (also called service time) for each process, answer the following questions. (a) First Come First Service (FCFS) * (b) Preemptive Shortest Job first * (c ) Round-Robin with time quantum of 4 (Assume that new processes will be inserted at the end of the ready list
2. Write programs in eitherCor Java or python (choose your preference ) to simulate the following scheduling Algorithms with their respective Gantt Charts displayed during run time: (i) FCFS- First Come First Serve Scheduling (ii) SJF- Shortest Job First Scheduling (Non - Preemptive and Pre-emptive both) (iii) LJB-Longest Job First Scheduling (Non - Preemptive and Pre-emptive both) (iv) Priority Scheduling (Non - Preemptive and Pre-emptive both)
Modiflow y the beprogram given to include response time program;ROUND ROBIN CPU SCHEDULING ALGORITHM #include<stdio.h> #include<conio.h> using namespace std; int main() { int i,j,n,bu[10],wa[10],tat[10],t,ct[10],max; float awt=0,att=0,temp=0; printf("Enter the no of processes--"); scanf("%d",&n); for(i=0;i<n;i++) { printf("\nEnter Burst Time for process %d--", i+1); scanf("%d",&bu[i]); ct[i]=bu[i]; } printf("\nEnter the size of time slice--"); scanf("%d",&t); max=bu[0]; for(i=1;i<n;i++) if(max<bu[i]) max=bu[i]; for(j=0;j<(max/t)+1;j++) for(i=0;i<n;i++) if(bu[i]!=0) if(bu[i]<=t) { tat[i]=temp+bu[i];…
76. To ensure that the hold and wait condition never occurs in the system, it must be ensured that : a. whenever a resource is requested by a process, it is not holding any other resources b. each process must request and be allocated all its resources before it begins its execution c. a process can request resources only when it has none d. all of the mentioned
47. Before proceeding with its execution, each process must acquire all the resources it needs is called a. hold and wait b. No pre-emption c. circular wait d. starvation
26.1-10For what number of processors do the two versions of the chessprogram run equally fast, assuming that TP = T1/P + T∞? A chess lessonTo illustrate the power of work/span analysis, this section closes with atrue story that occurred during the development of one of the firstworld-class parallel chess-playing programs [106] many years ago. Thetimings below have been simplified for exposition.The chess program was developed and tested on a 32-processorcomputer, but it was designed to run on a supercomputer with 512processors. Since the supercomputer availability was limited andexpensive, the developers ran benchmarks on the small computer andextrapolated performance to the large computer.At one point, the developers incorporated an optimization into theprogram that reduced its running time on an important benchmark onthe small machine from T32 = 65 seconds to seconds. Yet, thedevelopers used the work and span performance measures to concludethat the optimized version, which was…
Function mycpu() is implemented in xv6 in a file named ______. Consider the First Come First Serve (FCFS) algorithm for the scheduling of three processes A, B, C. None of these processes will perform I/O operations. Their arrival time in seconds are 0, 2, 1 respectively. Their running time in seconds are 11, 6, 8 respectively. The turnaround time of A will be .The turnaround time of B will be . The turnaround time of C will be . The response time of A will be . The response time of B will be . The response time of C will be Consider the Shortest Job First (SJF) algorithm for the scheduling of three processes A, B, C. None of these processes will perform I/O operations. Their arrival time in seconds are 0, 10, 20 respectively. Their running time in seconds are 100, 50, 30 respectively. The turnaround time of A will be .The turnaround time of B will be . The turnaround time of C will be . The response time of A will be . The response time of B will be . The response time of C will be…
44. What is known as a race condition? a. When a deadlock occurs b. When it has a starvation and not a deadlock c. When the result of a computation depends on the speed of the processes involved d. When it cannot have a subroutine call.
Modiflow y the beprogram given to include response time program;SJF CPU SCHEDULING ALGORITHM #include<stdio.h> #include<conio.h> using namespace std; int main() { int p[20], bt[20], wt[20], tat[20], i, k, n, temp; float wtavg, tatavg; printf("\nEnter the number of processes--"); scanf("%d", &n); for(i=0;i<n;i++) { p[i]=i; printf("Enter Burst Time for Process %d--", i); scanf("%d", &bt[i]); } for(i=0;i<n;i++) for(k=i+1;k<n;k++) if(bt[i]>bt[k]) { temp=bt[i]; bt[i]=bt[k]; bt[k]=temp; temp=p[i]; p[i]=p[k];…
Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this order. The processes have the following service times (in time units): Process P1 P2 P3 P4 Service time (CPU burst) 53 17 68 24 For the scheduling method "Shortest Job First" (SJF), specify the execution order of the processes, the average execution time (average turnaround time) and the average waiting time over all processes. You must show your calculations. You will not have to draw Gantt charts.