close

A3

 A3 Article
  • A3
  • 05.09.2019

6. 10 – What makes it important for the scheduler to tell apart I/O-bound programs from CPU-bound programs? I/O-bound programs make use of very little calculation while getting performed so do not consume their complete CPU mess. CPU programs use all their entire quantum without obstructing the I/O operations. 6. 16 – Consider the subsequent set of operations, with the entire CPU rush given milliseconds: Process

P1

P2

P3

P4

P5

Burst Time

2

you

8

4

5

Top priority

2

1

4

2

3

The processes are presumed to have found its way to the order P1, P2, P3, P4, P5, every at period 0. (a) Draw several Gantt chart that demonstrate the setup of these techniques using the subsequent scheduling methods: FCFS, SJF, non-preemptive goal (a bigger priority number implies an increased priority), and RR (quantum = 2). FCFS

------------------------------------------------------------------------------------ | P1 | P2 | P3 | P4 | P5 | ------------------------------------------------------------------------------------ 0 2 3 11 15 20 SJF

------------------------------------------------------------------------------------ | P2 | P1 | P4 | P5 | P3 | ------------------------------------------------------------------------------------ 0 one particular 3 several 12 twenty Non-preemptive concern

------------------------------------------------------------------------------------ | P2 | P1 | P4 | P5 | P3 | ------------------------------------------------------------------------------------ 0 1 several 7 doze 20 Round-Robin

------------------------------------------------------------------------------------ | P1 | P2 | P3 | P4 | P5 | P3 | P4 | P5 | P3 | P5 | P3 | ------------------------------------------------------------------------------------ zero 2 3 5 six 9 11 13 15 17 18 20

(b) What is the turnaround time of each method for each from the scheduling methods in part a?

FCFS

Method

P1

P2

P3

P4

P5

Transformation Time

2

3

eleven

15

twenty

SJF

Process

P1

P2

P3

P4

P5

Turnaround Time

3

1

twenty

7

12

Non-preemptive goal

Process

P1

P2

P3

P4

P5

Turnaround Time

3

one particular

20

7

12

Round-Robin

Process

P1

P2

P3

P4

P5

Turnaround Period

2

a few

20

13

18

(c) What is the waiting time of each method for each of these scheduling algorithms? FCFS

Procedure

P1

P2

P3

P4

P5

Waiting Time

zero

2

three or more

11

12-15

SJF

Procedure

P1

P2

P3

P4

P5

Ready Time

1

0

12

3

six

Non-preemptive top priority

Process

P1

P2

P3

P4

P5

Waiting Time

1

zero

12

three or more

7

Round-Robin

Process

P1

P2

P3

P4

P5

Waiting Period

0

two

12

being unfaithful

13

(d) Which of the algorithms results in the bare minimum average holding out time (over all processes)? SJF and non-preemptive top priority resulted in the lowest average waiting time. (In this case)

6. 19 – Which will of the following scheduling methods could result in misery? (a) First-come, first-served

(b) Shortest work first

(c) Round robin

(d) Concern

Shortest task first and Priority arranging could result in starvation.

6. 21 years old – Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks concern an I/O operation when for every nanosecond of CENTRAL PROCESSING UNIT computing which each I/O operation requires 10 ms to full. Also assume that the context-switching overhead is definitely 0. 1 millisecond and this all processes are long-running tasks. Identify the CENTRAL PROCESSING UNIT utilization for any round-robin scheduler when: (a) The time portion is 1 )..

 Exam M Notes F05 Essay

Exam M Notes F05 Essay

Chapter three or more: Survival Allocation and Your life Tables Syndication function of X: Force of fatality µ(x): forex (x) you…...

Read
 Human Factors Essay

Human Factors Essay

http://en.wikipedia.org/wiki/Human_factors [edit] Launch Simply put, man factors requires the study of every aspects of the way humans relate with the world around them, with the purpose of improving detailed…...

Read