QUESTION 1 (35 MARKS)BITS 1213-OPERATING SYSTEMASSIGNMENT 2 (5%)a. Given the following jobs that are to be processed on a single processor:i.ii.ProcessP1P2P3Table 1: Process SchedulingP4Arrival Time Service Timein msin ms02465294Illustrate a Gantt chart to show the schedules for Shortest Remaining Time (SRT) andShortest Process Next (SPN) policies.Estimate the finish time, turnaround time, and normalized turnaround time for bothalgorithms.(20 Marks)

Hello student The answer will be in next step :-

BITS 1213-OPERATING SYSTEM ASSIGNMENT 2 (5%) QUESTION 1 (35 MARKS) a. Given the following jobs that are to be processed on a single processor: ii. Process P1 P2 P3 Table 1: Process Scheduling Arrival Time in ms P4 0 2 4 6 Service Time in ms 5 2 9 4 Illustrate a Gantt chart to show the schedules for Shortest Remaining Time (SRT) and Shortest Process Next (SPN) policies. Estimate the finish time, turnaround time, and normalized turnaround time for both algorithms. (20 Marks)

BITS 1213-OPERATING SYSTEM ASSIGNMENT 2 (5%) QUESTION 1 (35 MARKS) a. Given the following jobs that are to be processed on a single processor: ii. Process P1 P2 P3 Table 1: Process Scheduling Arrival Time in ms P4 0 2 4 6 Service Time in ms 5 2 9 4 Illustrate a Gantt chart to show the schedules for Shortest Remaining Time (SRT) and Shortest Process Next (SPN) policies. Estimate the finish time, turnaround time, and normalized turnaround time for both algorithms. (20 Marks)

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

110. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.Process P0 P1 P2 Maximum needs (process-wise : P0 through P2 top to bottom) 10 4 9Currently allocated (process-wise)522Which of the following sequence is a safe sequence ? a. P0, P1, P2 b. P1, P2, P0 c. P2, P0, P1 d. P1, P0, P2
(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
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.
Five (5) processes A, B, C, D, and E are waiting to be executed. Their expected burst times (in ms) are 10, 5, 8, 2 and 5 respectively. These processes come at times (in ms.) 23, 12, 0, 5, and 15 respectively. By using FCFS algorithm to schedule the execution what is the system's throughput (in process/ms)? what is the CPU utilization? what is the average turnaround time of all the processes? what is the average waiting time of all the processes
OPERATING SYSTEMS, ANSWER IN 10 MINUTES, DO NOT BE LATE PLEASE !!!!!!!! Consider the following set of processes with the length of the next CPU burst given in milliseconds: P1 - 8 ms, P2 - 4 ms, P3 - 1 ms. Select the Gantt chart illustrating the execution of these processes using the pre-emptive Round Robinscheduling algorithm with quantum = 2.
Question no 2: Consider the following set of four processes. Their arrival time and time to require completing the execution are given in the following table. Consider all times in milliseconds. Implement the SJF algorithm on the given chart. Process Arrival Time (T0) Time required for completion (CPU Burst Time) P0 0 10 P1 1 6 P2 3 2 P3 5 4
Our CPU is currently idle and the current time is labeled time 0. Fourprocesses arrive to the ready queue at the following times and with the following requiredrun time:Process Arrival Time Run TimeA 0 9B 1 28C 2 7D 3 3Simulate the process scheduling and execution under the FCFS, SJF, and SRTN schedulingalgorithms. Indicate each scheduling decision, and calculate the turnaround time for eachprocess. Also calculate the average turnaround time for each scheduling algorithm. I havestarted the solution below for FCFS to give an example of the format for your answer.
A)Given the following jobs that are to be processed on a single processor: Table 1: Process Scheduling Process Arrival Time in ms Service Time in ms P1 0 5 P2 2 2 P3 4 9 P4 6 4 Illustrate a Gantt chart to show the schedules for Shortest Remaining Time (SRT) and Shortest Process Next (SPN) policies. Estimate the finish time, turnaround time, and normalized turnaround time for both algorithms. B)Consider the following set of processes: Table 2: Process Scheduling Process Arrival Time Service Time A 0 3 B 2 5 C 4 2 D 8 5 Perform analysis for the set of processes in Table 2 to describe Round-robin (q= 1) scheduling policies performance. In your analysis, you are required to: i) Illustrate the execution pattern for one cycle. ii) Estimate the finish time, turnaround time, and normalized turnaround time. a) Discuss the performance of SRT, and Round Robin scheduling policy…
subject:operating system Question # 3 Consider two resources are available and value of semaphore is 2. Now consider operations P() and V() and their execution sequenceP(), P(), V(), P(), P(), V(), P(), P(), P(), V(), V(), P(). Answer the followings after the completion of above functions: Number of process which are sleeping on P()? What will be the value of semaphore? Number of available resources? Find the value of logical address and limit register. The value of base register is 400K and value of physical address is 532k.
1. Consider two processes, P1 and P2, where p1 = 50, t1 = 25, p2 = 75, and t2 = 30. a. Can these two processes be scheduled using rate-monotonic scheduling? Illustrate your answer using a Gantt chart time-lined upto at most 150 milliseconds. b.Compute the CPU utilization for the process in part a and state the precise circumstance that will allow rate monotonic schedulling to miss a deadline when scheduling hard real time process? Do show your calculation.
A virtual memory system has an address space of 8K words, a memory space of 4K words, and page and block sizes of 1K words. The following page reference changes occur during a given time interval: 4201204126735 Determine the four pages that are resident in main memory after each page reference change if the replacement algorithm used is (a) FIFO; (b) LRU Explain in detail.
A superscalar computing system with the 2nd degree of Superscalar and with 3 processing units. The instructions are: I1: Require 2 execution cycles I2: Require 4 execution cycles I3& I4: Conflict for resources I3& I4: Require 2 execution cycles I5: Data dependency on I4 I6 to I9: No constraints Analyze the performance of this system in terms of clock cycles count for the following three cases. In-order issue and In-order completion In-order issue and out-of-order completion Out-of-order issue and out-of-order completion