Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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

image text in transcribed

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 job mix on this system by indicating 1ms of computation for a job via an uppercase letter (we assume that the time quantum and the CPU bursts are integral numbers of ms). For example, the following string: AAAoBoCoAAoDDD means that job A executes for 3ms, then job B for 1ms, then job C for 1ms, then job A again for 2ms, then job D for 3ms, with appropriate context-switches in between. This example execution lasts 10ms+4x0.1ms 10.4ms (10ms of actual job execution, 4ms of context-switch overhead) Question #1 [15pts]: Consider the following execution: AAAAAoBBoCoDODDDOAAAAAoCoDDODDoAAAoCoDDDDDOAAAAAoBBB Answer the following questions: [q1] Knowing that there is at least one CPU-bound job in this mix, could the time quantum be 6ms? Why? [q2] Which job seems to have the longest I/O burst? Why? [q3] Knowing that one of this jobs is a text editor, which job do you think it is? Why? 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 job mix on this system by indicating 1ms of computation for a job via an uppercase letter (we assume that the time quantum and the CPU bursts are integral numbers of ms). For example, the following string: AAAoBoCoAAoDDD means that job A executes for 3ms, then job B for 1ms, then job C for 1ms, then job A again for 2ms, then job D for 3ms, with appropriate context-switches in between. This example execution lasts 10ms+4x0.1ms 10.4ms (10ms of actual job execution, 4ms of context-switch overhead) Question #1 [15pts]: Consider the following execution: AAAAAoBBoCoDODDDOAAAAAoCoDDODDoAAAoCoDDDDDOAAAAAoBBB Answer the following questions: [q1] Knowing that there is at least one CPU-bound job in this mix, could the time quantum be 6ms? Why? [q2] Which job seems to have the longest I/O burst? Why? [q3] Knowing that one of this jobs is a text editor, which job do you think it is? Why

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

101 Database Exercises Text Workbook

Authors: McGraw-Hill

2nd Edition

0028007484, 978-0028007489

More Books

Students also viewed these Databases questions

Question

CL I P COL Astro- L(1-cas0) Lsing *A=2 L sin(0/2)

Answered: 1 week ago

Question

5. Understand how cultural values influence conflict behavior.

Answered: 1 week ago