CPU Scheduing FCFS, Operating System

Assignment Help:
Assume
that
P
A
, P
B
and P
C
are three
distinguished
program
s
. When
P
A
is
executed, it
needs 10 ticks to complete its execution and it forks new
processes executing P
B
at
tick
-
marks
4 and 7. Similarly,
P
B
needs 8 ticks to
complete its execution and it forks new processes executing P
C
at
tic
k
-
marks
3
and 5
; and P
C
needs 4 ticks to complete its execution and it does an I/O a
t
tick
-
mark 2
. Assume that
I/O requests will be handled in a
first
-
come
-
first
-
serve
manner and each I/O
can be completed within 4 ticks
.
Assume that
process P
1
, which is executing program P
A
arrives at t=
0

.
Draw a Gantt chart
illustrating the scheduling of these processes if a
r
ound
-
r
obin
scheduling
with
a time quantum of
3
is used.

Related Discussions:- CPU Scheduing FCFS

Why do organisations need a structure, Problem 1: (a) The grouping of o...

Problem 1: (a) The grouping of organisational activities (usually into ‘departments' or larger ‘divisions') can be done in different ways. Outline 7 criteria which can be used

Deadlock detection, Deadlocks can be detected while the program is running,...

Deadlocks can be detected while the program is running, by running cycle detection algorithms on the graph that de?nes the current use of resources. De?ne this graph as follows:

What are the use of job queue, What are the use of job queues, ready queues...

What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The

Explanation of computer clustering and benefits, The CTO is still impressed...

The CTO is still impressed with your work. He just came back from a technology exposition where he heard about computer clusters. All he knows is that they are the big thing for bu

Define rotational latency and disk bandwidth, Define rotational latency and...

Define rotational latency and disk bandwidth. Rotational latency is the additional time waiting for the disk to rotate the wanted sector to the disk head. The disk bandwidth is

Why is rotational optimization no longer consequently useful, UNIX systems ...

UNIX systems utilized to use disk-layout optimizations based on the rotation position of disk data however modern implementations including Linux simply optimize for sequential dat

Estimation the number of input - output per second, Q. Remapping of bad bl...

Q. Remapping of bad blocks by sector sparing or else sector slipping could influence performance. Presume that the drive in Subsequent Exercise has a total of 100 bad sectors at r

Define the executor (worker thread), Define the Executor (Worker Thread)  ...

Define the Executor (Worker Thread)  The responsibility of the Executor (or Worker Threads) is to execute instructions on behalf of a client-server connection. The Executor mus

Binary and data representation, Computing uses three number bases:- Binary ...

Computing uses three number bases:- Binary (base 2), Octal (base 8) and Hexadecimal (base 16). Binary has been described before, although various catchphrases are used to describe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd