Consider the following set of processes, withthe length of the CPU-burst time given inmilliseconds,ProcessCPU Burst TimeP1P21P3P41P57The processes are assumed to have arrivedin the order P1, P2, P3, P4, P5 all at time 0.Draw four Gantt charts illustrating the(i)execution of these processes using SJFand RR (quantum = 1) scheduling.(ii) What is the waiting time of each processfor each of the scheduling algorithms inpart (i)?%3D

Answered: Consider the following set of…

Engineering

Computer Science

Consider the following set of processes, with the length of the CPU-burst time given in milliseconds.

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

Related questions

Q: Consider the following set of processes A, B, C. D with the following CPU burst time and I/O. Find…

A: Context switch latency: 2 ms Total service time: 68 ms Round robin (RR), with quantum:10 Total…

Q: Consider the following fragment of C code for (i=0; i<=100; i=i+1) { a[i] = b[i] + c; }…

A: The objective of the question is to translate a given C code fragment into RISC-V assembly language,…

Q: For the RR scheduling algorithm, Burst time of 5 processes(p0,p1,22,23,24) are as follows (2ms, 3ms,…

A: The Round Robin (RR) scheduling algorithm is a widely used preemptive scheduling algorithm in…

Q: If the component which can be changed in a given system is fifty percent of the total system and can…

A: Allow us to answer only 2 to 3 question when multiple questions are posted Answer: Using Ahmdal's…

Q: Consider a group of CPU-time sharing processes P1 , P2, ... Pn with CPU burst times of 1,2,...,n…

A: If there are n process with CPU burst times 1,2,3,.................,n That means the first process…

Q: Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this…

A: Answer is given below

Q: Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS…

A: Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS…

Q: Find the ratio of CPU utilization for a system spend 120 minutes to execute the processes and the…

A: The question has been answered in step2

Q: Consider a hypothetical system, a 48-bit width main memory with a capacity 256 TB is build using 64…

A: Given: Total number of rows of memory cell in the DRAM is = 225 48 -bit width main memory.…

Q: Given six memory holes of 540 KB, 620 KB, 220 KB, 110 KB, 120 KB, and 250 KB (in order), how would…

A: Approach to solving the question with detailed explanation: In memory management, the first-fit,…

Q: A swapping system eliminates holes by compaction.Assuming a random distribution of many holes and…

A: 4096 x 2^20 / 4 = 2^30 memory address compaction time = (read + write) * # of memory access…

Q: In MATLAB, a grey-scale image is stored a a matrix of numbers, all between 0 (black) and 255…

A: In MATLAB, grayscale images are represented as matrices of numbers, where each pixel's intensity…

Q: The same software is compiled on three computers A, B, and C with the clock frequency of 2GHZ,…

A: Given: In all the three computers A, B and C same software is compiled with the clock frequency of…

Q: A systolic array, which is the kind of array that a MISD machine is an example of, is one type of…

A: Answer: A systolic array is a type of parallel computing architecture that is designed to perform…

Q: For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround…

A: All the process arrive at same time in the sequence P1->P2->P3->P4. The time quantum time…

Q: Suppose you are asked to design a rotating disk where the number of bits per track is constant. You…

A: Consider the information given:

Q: Obtain the average waiting time, and the turnaround time, including CPU Utilization and throughput,…

A: Scheduling is the action of assigning resource to perform tasks.

Q: Consider a system with only two types of instructions, A and B. Type A instructions each require 7…

A: Given: Type A instructions each require (CPIA ) = 7 clock cycles Type B instructions each require…

Q: Consider a program that performs the following steps repeatedly: Use the CPU for 4 milliseconds. By…

A: The program in question uses CPU, disk, and network resources to iteratively go through a series of…

Q: Consider the case where the CPU is required to send a byte to a printer. In three to four stages,…

A: Answer : When user give instructions for print.

Q: Benchmark Processor X Y Z 1 20 10 40 2 40 80 20 Table 1.1 shows the execution times, in…

Q: ccording to Amdahl's Law, what is the maximum possible % reduction in execution time when: process…

A: In computer architecture, Amdahl’s law (or Amdahl’s argument) is a formula which gives the…

Q: Consider a group of 5 benchmarks. With an old generation of CPU in the 90s, the execution times of…

A: Speed Up=n= execution time of B/ execution time of A n1=5/10=1/2 n2= 2/16=1/8 n3= 2/4 = 1/2 n4 =…

Q: Suppose a process is responsible for YZ% of the execution time on a machine. Using a particular…

A: Given a process takes up YZ% of execution time on a machine. where Y=First digit of your roll…

Q: Q1. A student uses a microcontroller to implement a timer that can measure from 0 to 99.999 seconds.…

A: Foundations of Time The timer (sometimes called a timer) is a special piece of hardware inside most…

Q: A MISD machine is an example of a systolic array, a kind of array. Data processing units are…

A: Introduction: When every node has received all of the arrays, or at the very least the precise…

Q: Q1. Consider that the up system consists of two memory sections, the SRAM and the EPROM. The up…

A: Wait state is a delay encountered by a computer processor when accessing external memory or a…

Q: Consider a program that accesses a single I/O device and compare unbuffered I/O to the use of a…

Q: We have 4 periodical processes II₁, II, II and II, that process a video. We know their periods P;…

Q: Consider four processes with the following start and end times: Process Start Time End Time A B C D…

A: To run procеssеs concurrеntly based on thеir start timе and еnd timе, you can use the following…

Q: Two algorithms A and B report time complexities expressed by the functions n2 and 2n , respectively.…

A: The solution is given in the below step

Q: Consider a program that accesses a single I/O device and compare unbuffered I/O to the use of a…

A: In this question we have given a program which has access to single Input / Output device. We need…

Q: A MISD machine is an example of a systolic array, a kind of array. Data processing units are…

A: Here is the answer below:- Introduction: Synchronous processing units (DPUs) area unit cells or…

Q: for the given procsees, draw the time chart round-robin and compute CPU waiting bimes, utiliaation,…

Q: A common unit of measure for failure rates of electronic components is the Failure unIT (FIT),…

A: MTBF means to predict average time between inherit failures of system during operation of normal…

Q: omputer Science Assume the options of the access time and cycle time of a memory system to retrieve…

A: Task : Size memory word = 4 Bytes Access time of memory system = 10 ns. Cycle time of memory system…

Q: Consider the following four processes with the length of CPU burst time in milliseconds (P1: 20,…

A: FCFS FCFS(First Come First Serve) is an operating system scheduling algorithm that automatically…

Q: Consider what happens when the CPU performs a load operationsuch as movq A,%rax

A: Given operation is, movq A,%rax In this statement, %rax represents the register movq means move the…

Q: OS Process Let's Try This (1) CPU-burst Arrival Time

A: Step 1 The parameters given in the above question is mention as below, Given : 5 processes along…

Q: is the way to faster execution. We talked about two different basic execution models that can…

A: Parallel execution is the execution of multiple CPU and input output operation on a single device…

Q: 20% of all instructions are arithr 40% are load,

A: CPI (Cycles Per Instructions) is the number of cycles or clock ticks that an instruction requires to…

Q: A digital counter is a device that generates binary numbers in a specified count sequence. The…

Concept explainers

Properties of different architectures

Software architectures are the blueprint of a software system. They consist of all components involved in a system, relations between various components, the environment of operation, and the principle used in designing the software. In other words, software architecture shows the organization of different software structures and helps understand their behavior.

Question

Consider the following set of processes, with
the length of the CPU-burst time given in
milliseconds,
Process
CPU Burst Time
P1
P2
1
P3
P4
1
P5
7
The processes are assumed to have arrived
in the order P1, P2, P3, P4, P5 all at time 0.
Draw four Gantt charts illustrating the
(i)
execution of these processes using SJF
and RR (quantum = 1) scheduling.
(ii) What is the waiting time of each process
for each of the scheduling algorithms in
part (i)?
%3D

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider the following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to make a Gantt chart.
A MISD machine is an example of a systolic array, a kind of array. Data processing units are organized into a "wavefront" in a systolic array. All of these components do not need the use of a program counter since execution is initiated when new data is received. Lock-step computation is achieved in a clocked-systolic array, where each unit completes its alternating calculation and communication phases in the same clock cycle.
Define the minimax algorithm and the terminology used in it.
If random access memory (RAM) and cache memory (both of which are comprised of transistors), then what is the function of cache memory? Do we need several different forms of memory, or can we get by with only one?
On a computer system with one processor (CPU), and N (N> 1) processes present in the system, what is the maximum number of processes that can be in the Running, and in the Blocked states at any given time? Assume 5-state model for process states.
Consider the following processes with the given CPU arrival time and burst time. Please use the shortest remaining time first algorithm to compute for the CPU utilization
Assume an algorithm takes 7.4 seconds to execute on a single 3.5 GHz processor. 49% of the algorithm is sequential. Assume that there is zero latency and that the remaining code exhibits perfect parallelism. How long (in seconds) should the algorithm take to execute on a parallel machine made of 4 3.5 GHz processors? Round answers to one decimal place (e.g. for an answer of 17.214 seconds, you would enter 17.2).
Consider the following set of 5 processes, with the length of the CPU-burst time given in milliseconds arriving at time 0: P1, P2, P3, P4, and P5 with corresponding burst time: 20, 47, 13, 17 and 22. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Calculate average waiting time for First Come First Serve and None Preemptive Shortest Job First CPU scheduling algorithms. b. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
Given three CPU s, A,B, and C, where a given program takes 5 ms on A 250 us on B 50 ns on C Find the speed up ratios between A:B. B:C. and A:C
Consider the following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to compute for the waiting times for each process.