Ex1: Consider the following process arrival, CPU and 1/O burst times. Assume that only I/O deviceis available and it operates in FCFS manner. Assume that there is only one CPU and it uses SRTFalgorithm.ProcessArrival timeCPU1/0CPUA298B3.51C72Draw the Gantt charts for the CPU and I/O device to compute the waiting time and turnaround time(tat) of all processes and CPU utilization. Put your answers into the table given belowCPU Gantt Chart1/0 Gantt ChartWait (A) Wait (B)Wait (C) Tat(A)Tat(B)Tat(C)CPU Utilization

Answered: Image /qna-images/answer/f0c8c58d-b3f3-448a-acb7-61f3f5ad3a03.jpg

• Ex1: Consider the following process arrival, CPU and I/O burst times. Assume that only I/0 device is available and it operates in FCFS manner. Assume that there is only one CPU and it uses SRTF algorithm. Process Arrival time CPU 1/0 CPU A 4 2 9 8 1 7 2 Draw the Gantt charts for the CPU and I/O device to compute the waiting time and turnaround time (tat) of all processes and CPU utilization. Put your answers into the table given below CPU Gantt Chart 1/0 Gantt Chart Wait (A) Wait (B) Wait (C) Tat(A) Tat(B) Tat(C) CPU Utilization

• Ex1: Consider the following process arrival, CPU and I/O burst times. Assume that only I/0 device is available and it operates in FCFS manner. Assume that there is only one CPU and it uses SRTF algorithm. Process Arrival time CPU 1/0 CPU A 4 2 9 8 1 7 2 Draw the Gantt charts for the CPU and I/O device to compute the waiting time and turnaround time (tat) of all processes and CPU utilization. Put your answers into the table given below CPU Gantt Chart 1/0 Gantt Chart Wait (A) Wait (B) Wait (C) Tat(A) Tat(B) Tat(C) CPU Utilization

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 the following table that contains the CPU and I/O burst times, and arrival times of the given processes. Processes P1 P2 P3 CPU CPU I/O 2 5 7 I/O 9 3 2 CPU 8 1 5 Arrival time 4 Using the SRTF scheduling algorithm draw the Gantt charts for CPU (one core system), and draw the IO gantt chart assume that only one I/O device is available and operates in FCFS manner: 0
Consider the following process arrival, CPU and I/O burst times. Assumethat only one I/O device is available and it operates in FCFS manner. Ignorethe switching times for both the CPU and I/O device. Assume that there isonly one CPU and it uses shortest remaining time first (SRTF, preemptive)scheduling algorithm. show the picture to see full question.................
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%.
A single-CPU system has four processes, P1, P2, P3 and P4 in the ready queue. The execution times and I/O needs for these processes are given below. All times are in ms. (hint: when a process starts an IO operation, it is removed from the ready queue and put back at the end of the queue only when it completes its IO). Process P1: Arrives at 0ms, needs 23ms of CPU time. Performs I/O for 5ms after 10ms of its execution time, then another 5ms after 20ms of its execution time. Process P2: Arrives at 3ms, needs 12ms of CPU time. Performs I/O for 10ms after 5ms of its execution time. Process P3: Arrives at 1ms, needs 15ms of CPU time. Performs I/O for 1ms after 7ms of its execution time. Process P4: Arrives at 2ms, needs 8ms of CPU time. Performs I/O for 5ms after 4ms of its execution time. We assume that the CPU is idle if no one of these four processes is using it. Using Round Robin scheduling algorithm with a Time Quantum of 4ms and ignoring the context switch time, determine: a) The…
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
Find the ratio of CPU utilization for a system spend 120 minutes to execute the processes and the total latency (Context switch time) time is 20 minutes.
Consider a system with 3 I/O devices Printer (priority of 2) Disk (priority of 4) Communication line (priority of 5) Higher priority is indicated by high numerical value. User program begins at t = 0 and the multiple interrupts occur at following time instances At t = 10, Printer interrupt occurs At t = 15, Communication interrupts occurs At t = 25 Disk interrupt occurs Show the time sequence of multiple interrupts, assuming that service routine for Printer interrupt takes 30 time units, Disk interrupt takes 10 time units, and Communication interrupt takes 5 time units.
Question 10 Assume a process executing CPU and 1/O bursts as follows: - (12,7.4,9,6), where 12,4, and 6 are CPU burst times and 7 and 9 are 1/O burst times. - Assume that after completing each CPU burst, the process goes to Waiting state and immediatelly does 1/O bursts. - Assume that this process spends the following times in the Ready list: - 2 time units before executing the first CPU burst, 6 time units after finishing first I/O burst and entering the second CPU burst, and 5 units after finishing second I/O burst and entering the third (last) CPU burst. Assuming New and Terminate State take O units, what is the total time his process stays in the system from entering until finishing the process. Select one answer only. O 51 O 38 O 25 O 44
Suppose the user process' size is 8192Kb and is a standard hard disk where swapping has a data transfer rate of 1Mbps. Calculate for the total swap time in milliseconds (swap-in time and swap-out time) of the 8192Kb process to and from the physical memory.
SFJ Process Suppose we have a four (4) core processor and all processes are designed to be multi-threaded. Now, like all processors with more than one core, they have the ability to perform multiple tasks at the same time. If there are four (4) with the following CPU and I/O cycles according to the table below, calculate the times for the SJF scheduling process (view image): Where A,B,C,D correspond to A=6, B=3, C=5, D=8.
The arrival time for processes A,B,C and D is 0,2,4, and 5 while the required CPU burst time is 7,4,1 and 4 respectively. Using SRTN, what is the average turn-around time?
Please help Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every 4 milliseconds of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also assume that the context-switching overhead is 2 milliseconds and that all processes are long-running tasks. Calculate the CPU utilization for a round-robin scheduler when the time quantum is 10 milliseconds (the result should be in the form of percentage, rational expression, or a ratio of two integers, such as 25/88, 81/121).