Question: Consider two processes, process A is CPU-bound with CPU burst time one hour, and process B is I/O-bound repeating CPU burst time 1 ms and

  1. Consider two processes, process A is CPU-bound with CPU burst time one hour, and process B is I/O-bound repeating CPU burst time 1 ms and disk I/O 9 ms. Please illustrate using Gnatt charts the round-robin scheduling with a time quantum respectively setting to 100 ms and 1 ms, and SRTF scheduling. Please discuss which one performs the best (10 points)? Hint: consider disk utilization and number of context switch.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

please code in language java or c The solution is by writing the code struct PCB { int proc-id; int PC; int CPU-Bust; int R1, R2, // Program Counter (Instruction Pointer IP) // Two dummy Registers...

Q:

please in java code This is a simulation of Round Robin (RR) CPU scheduling algorithm and the system queves: Given the following declarations: // Program Counter (Instruction Pointer IP) stract PCB...

Q:

Hello! Please Help Me! Help is greatly appreciated. Please explain your answers, Thank you. Exercise #1 [25 pts + 10 pts Consider an OS that schedules jobs with a single Round-Robin queue. The...

Q:

Please help me! Exercise #1 [25 pts + 10 pts Consider an OS that schedules jobs with a single Round-Robin queue. The context-switching overhead is o-0.1ms. We represent the execution timeline of a...

Q:

Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 b) What is the turnaround time for each...

Q:

Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 b) What is the turnaround time for each...

Q:

1. (TCO 1) The microkernel and modular OS design approaches are similar in which respect? (Points : 4) services communicate via message-passing both have a fairly monolithic structure object-oriented...

Q:

Problem description in terms of process scheduling Consider two processes, each with two CPU bursts with one I/O burst in between. Process 1 has a CPU burst of x1 units followed by an I/O burst of y1...

Q:

Detailed steps for this session: Define a very basic PCB structure: struct PCB {int ProcId; int ProcPR, int CPUburst; int Reg[8]; int queueEnterClock, waitingTime; /* other info */ struct PCB *next;}...

Q:

This assignment requires you to create simulations for different scheduling algorithms commonly employed by operating systems to achieve multiprogramming. All problems in this assignment assume the...

Q:

1. Describe what a line of credit involves, and explain the legal obligation of a bank to provide capital with a line of credit. 2. On what three priorities might Bank-RI representative Matt Weiner...

Q:

Use the balance sheet equation to determine owners equity if liabilities are $5 million and assets are $10 million.

Q:

What is the output of the following snippet? [ ' Mary ' , 'had', ' a ' , 'little', 'lamb' ] [ ' Mary ' , 'had', ' a ' , 'ram' ] [ ' Mary ' , 'had', ' a ' , 'lamb' ] no output, the snippet is erroneous

Q:

Which project management tool uses the analogy "skateboard - bicycle - motorcycle - car"? Group of answer choices Scrum Waterfall Fate - Gate Star - gate

Q:

4.39 A company installs new central-heating furnaces and has found that for 15% of all installations, a return visit is needed to make some modifications. Six installations were made in a particular...

Q:

4.33 For a binomial probability distribution with P = 0.4 and n = 20, find the probability that the number of successes is equal to 9 and the probability that the number of successes is fewer than 7.

Q:

4.31 For a binomial probability distribution with P = 0.5 and n = 12, find the probability that the number of successes is equal to 7 and the probability that the number of successes is fewer than 6.