Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process P1 P2 P3 P4 P5 Draw the Gantt charts illustrating the execution of these processes using: FCFS SJF (SPN) . SRT • HRRN a nonpreemptive priority (a smaller priority number implies a higher priority) . RR (q= 1) RR (q=3) Combining RR (q-2) and priority scheduling Feedback (q=1) . Feedback (q=2¹) CPU Burst Time/Service Time/ Arrival Time Priority 0 Processing Time 3 5 2 3 1 2 3 4 2 3 4 1 3 4

Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process P1 P2 P3 P4 P5 Draw the Gantt charts illustrating the execution of these processes using: FCFS SJF (SPN) . SRT • HRRN a nonpreemptive priority (a smaller priority number implies a higher priority) . RR (q= 1) RR (q=3) Combining RR (q-2) and priority scheduling Feedback (q=1) . Feedback (q=2¹) CPU Burst Time/Service Time/ Arrival Time Priority 0 Processing Time 3 5 2 3 1 2 3 4 2 3 4 1 3 4

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 four processes with the following start and end times: Process Start Time End Time ABCD 3 5 1 7 6 12 4 9 For each pair of proceses, say whether they run concurrently (Y) or not (N). (a) AB (b) AC (c) AD (d) BC (e) BD (f) CD
true/false Consider a group of CPU-time sharing processes P1 , P2, ... Pn with CPU burst times of 1,2,...,n units respectively arrive at the same time. The average waiting time of these processes is always less than n2/6 (regardless of scheduling algorithm)
NOTE: "Exekveringstid(ms)" means execution time or burst time in milliseconds Assume that a system with a CPU at one time has the following processes queued in the CPU's READY queue: Calculate the waiting time for the seven processes: 1) If FCFS is being used 2) If LRU is being used 3) If RR with time quantum of 8ms
Consider a computer whose RAM has the following memory partition: 4K, 8K, 20K, 2K. At time T, a snapshot of the process queue is taken and is given below. Queue Head Tail Process PO P1 P2 P3 P4 P5 P6 P7 Memory 2K 14K 3K 6K 6K 10K 7K 20K Usage time 4ms 10ms 2ms 8ms 4ms 1ms 8ms 6ms If the processes are allocated using FCFS algorithm with best-fit memory allocation, calculate the time at which P6 finishes its execution. Assume there is no additional time overhead for allocating these processes.
a single process, with execution time of BT time units, is detected by the system that uses Round Robin algorithm with time quantum of QT time units. Every time the time quantum elapses; a contect switch is always performed with CS time units. Assume that the process come at time equal to zero(0) If BT is 25, QT is 10 and CS is 2, what is the Cpu utilization of the system? If BT is 20, QT is 6 and CS is 1 what is the CPU utilization of the system? What is the CPU utilization if BT is equal QT and QT is equal to CS? What is the system's throughput if BT is less than QT? What is the system's turnaround time (TAT) if BT is less than QT?
Consider the following set of processes, with the length of the CPU bursts given in milliseconds. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0 Process Burst Time Priority P1 5 3 P2 11 4 P3 12 P4 1 P5 7 2 a. Draw 3 Gantt charts that illustrate the execution of these processes using the following schedulin algorithms. i. FCFS. Non pre-emptive priority with arrival time for P1, P2, P3, P4 and P5 as 0,2,3,4,5 respectively. (A smaller priority number implies a higher priority). SJF with arrival time for P1, P2, P3, P4 and P5 as 1, 2, 3, 4, 5. ii. 292 iii. b. Calculate the average waiting time for FCFS and SJF scheduling algorithms mentioned in the previous question. Show your work?
Asap
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 Service time (CPU burst) exe P1 53 und P2 17 P3 68 P4 all 24 ur ca ulations. TOU arts. For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround time) and the number of context switches. The time quantum q is set to 20 time units. You must show your calculations. You will not have to draw Gantt charts. Note: For RR, processes execute in order of their ID (i.e., P1-P2-P3-P4).
Consider the following set of processes, the length of the CPU burst time given in milliseconds: Process Burst time: P1 6 P2 8 P3 7 P4 3 Assuming the above process being scheduled with the 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.
In the working set model, the idea is to examine the most recent A page references. It is also known as an approximation of the Program's Locality. If the total demand is greater than the total number of available frames (D > m), then it will cause thrashing, because in this case, some processes will not have enough frames. Below you see 3 processes and their expected memory references during their execution. When will the thrashing happen to occur according to the Working set model? Assume total memory (m) is 13 and Delta (A ) is 5. Time: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 2 6 2 2 6 2 6 2 1 2 4 3 5 4 5 4 6 P1= I 8 6 I 8 6 I 9 4 9 8 I 6 9 9 9 9 P2= P3= 6 2 3 2 6 6 6 6 6 2 1 4 2 2 2 2 2
Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS represents the sequence of calls init(s), wait(s), wait(s), and signal(s) by some processes in an operating system. For each of the following sequences of calls, state the value of s and the number of processes blocked after the last call in the sequence: *(a) IW (b) IS (c) ISSSW (d) IWWWS (e) ISWWWW
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 Service time (CPU burst) 1. P1 53 P2 17 P3 68 P4 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.