Consider a demand-paged computer system which was recently measured to deter- mine the utilisation of CPU and the paging disk to decide the degree of multipro- gramming. The results are shown in the figure below. Explain what is happening in each scenario and what actions an operating system can take. Scenario 1 Scenario 2 Scenario 3 0 20 40 60 CPU utilisation ■ Disk utilisation 80 100

Consider a demand-paged computer system which was recently measured to deter- mine the utilisation of CPU and the paging disk to decide the degree of multipro- gramming. The results are shown in the figure below. Explain what is happening in each scenario and what actions an operating system can take. Scenario 1 Scenario 2 Scenario 3 0 20 40 60 CPU utilisation ■ Disk utilisation 80 100

Name: Consider a demand-paged computer system which was recently measured t
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider a demand-paged computer system which was recently measured to deter-mine the utilisation of CPU and the paging disk to decide the degree of multipro-gramming. The results are shown in the figure below. Explain what is happening ineach scena

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

I need the answer as soon as possible
Consider the following set of processes, assumed to have arrived as shown in the table below with the length of the CPU burst given in milliseconds: Arrival Time Burst Process Priority Time P1 8 4 P2 6. 1 P3 2 1 P4 1 9. P5 Suppose that the processes arrive in the order: P1, P4, P3, P2, P5. The Time quantum is 2 milliseconds. Using Non- preemptive Priority scheduling algorithm, fill up the following table: Waiting Turnaround Time Response Time Time P1 P2 P3 P4 P5 Average
A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows: Allocated Maximum Available Process A 102111121300x11 20110 22210 11010 21310 11110112 21 Process B Process C Process D The smallest value of x for which the above system in safe state is
Assume in a Virtual Memory system, a program needs 10 pages with page numbers 0 to 9 and each page is 4 words and the program is allocated 3 page frames: a, b, and c. The word trace for 26 memory accesses by the program are listed below. Use a table similar to the one shown on Slide 7 of Lesson 20 to compare the three replacement policies: LRU, OPTimal, and FIFO, by calculating and comparing the hit rate of each policy for these 26 memory accesses. Word trace: 0, 1, 2, 3, 8, 16, 17, 4, 5, 6, 7, 9, 10, 11, 12, 8, 9, 10, 28, 29, 30, 4, 5, 12, 4, 5
Consider five processes p1, p2, p3, p4 and p5 that are wants to perform operationarriving at time 0 and 2. Maximum time requirement of these process are 20, 40,10,30,5 unit respectively. Processes spend 10% on I/O operation, 70% on CPUexecution and last 20 % on I/O again. The CPU use SJF (preemptive version)algorithm, schedule a new process either when the running process gets blocked onI/O or when the running process finished its compute burst. Assume that all I/Ooperations can be overlapped as much as possible. Show complete working
Suppose that we have the table below that includes four processes with their Arrival times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Process Arrival CPU-burst ID time time P1 0 1 P2 3 3 P3 2 4 P4 4 3 Completion Time Response Turn Around Time Time Waiting Time a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.
QUESTION 14 Consider the following set of processes, with the length of the CPU burst given in milliseconds Process Arrival Time CPU Burst P1 5 P2 2 11 P3 5 5 Draw the Gantt chart & compute the average waiting and turnaround time for the processes in the above system using: Round-Robin algorithm considering time quantum as 4ms.
In a multiprogrammed environment with 32MB of RAM where all processes require9MB of unshared RAM and spend 40% of their time in I/O wait, calculate themaximum achievable CPU utilization. If the RAM available is increased by 700%and time spent in I/O wait increases by 100%, calculate how much RAM will remainunused when CPU utilization is just above 99%.
Consider the following table of set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, P5, with the length of the CPU burst given in milliseconds. Process P1 P2 P3 P4 P5 CPU burst time 8 1 2 1 5 2. Non-Preemptive Priority. 3. RR (Time Quantum = 6). Priority 5 1 3 4 2 a. Design the flow of processes in a Gantt chart using each of the following algorithms: 1. FCFS.