3. Consider the arrival time and burst time of five jobs specified in the table below. a. Apply the Shortest Remaining Time to Finish (SRTF) operating system algorithm. b. Generate a Gantt chart to show how/when each process is executed. c. Calculate the average wait time of the processes. Process ID Arrival Time | Burst Time 4 2 3 4 3 5 4 5 2 7 Time Table Process ID Exit Time Turn Around Waiting Time Time 1 2 3 4 Gantt Chart Process ID Time Average turn around time = Average waiting time = %23 %23 %23 %23 %23

3. Consider the arrival time and burst time of five jobs specified in the table below. a. Apply the Shortest Remaining Time to Finish (SRTF) operating system algorithm. b. Generate a Gantt chart to show how/when each process is executed. c. Calculate the average wait time of the processes. Process ID Arrival Time | Burst Time 4 2 3 4 3 5 4 5 2 7 Time Table Process ID Exit Time Turn Around Waiting Time Time 1 2 3 4 Gantt Chart Process ID Time Average turn around time = Average waiting time = %23 %23 %23 %23 %23

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

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.
P1, P2, P3 and P4 are five processes arriving at different times of 0, 1, 5, 6. Each processhas a burst time of 2, 2, 3 and 4 respectively. Compute the average waiting time and drawthe Gantt chart illustrating the process executions using First-Come-First-Serve scheduling.
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.
We are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
Given below are the arrival and burst times of four processes P1, P2, P3 and P4. Using SJF preemptive and RR scheduling (Quantum = 5ms, no priority based preemption). PROCESS NO Arrival time (msec) Burst time(msec) P1 2 7 P2 3 3 P3 4 5 P4 6 6 Write a program to calculate the average waiting time, average turnaround time, average response time, throughput, and CPU utilization. For what percentage of does the CPU remain idle?
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…
Assignment 11. Consider the following set of processes,with the length of the CPU burst and arrival timegiven in seconds: Process Arrival Time Burst TimeP2 0 12P3 3 8P4 5 4P1 10 10P5 12 6 a. Draw Gantt chart that illustrate the execution of these processes using the preemptive Shortest Job First.b. What is the turnaround time of each process?c. What is the waiting time of each process?d. What is the Average turnaround time of the execution?e. What is the Average waiting time of the execution?2. Consider the following set of processes, with the length of the CPU burst and arrival time given in seconds: Process Arrival Time Burst TimeP2 0 12P3 3 8P4 5 4P1 10 10P5 12 6 a. Draw Gantt chart that illustrates the execution of these processes using the FCFS.b. What is the Average turnaround time of the execution?c. What is the Average waiting time of the execution?
Question- Provide technical reasoning for the following statements: In a typical desktop based operating system, execution of deadlock detection techniques at each resource request is undesirable. The two-state process model is inadequate representation of process states. Long-term scheduler executes relatively infrequently as compared to the other two medium and short-term schedulers. In dynamic memory partitioning, though compaction is beneficial but its frequent running is not desirable.
Draw the Gantt chart, Calculate the Average Turnaround Time AND Average Waiting Time for the following processes using Round Robin Scheduling. Assume that the time quantum is 4 ms. Processes Arrival Time CPU BURST Time P1 0 8 P2 1 4 P3 2 2 P4 3 1
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…
(A) What are the reasons for providing interprocess communication? (B) Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. What is the average turnaround time
Draw the Gantt chart, Calculate the Average Turnaround Time AND Average Waiting Time for the following processes using FCFS Scheduling. Processes Arrival Time CPU Burst Time P1 0 6 P2 1 4 P3 2 3 P4 3 2