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

Define a linker program, Define a linker program  A linker program lin...

Define a linker program  A linker program links the program along with other programs required for its execution.

Recognition of essential syntactic constructs by reductions, Recognition of...

Recognition of essential syntactic constructs by reductions, this task is carried out by Recognition of essential syntactic constructs by reductions, this task is carried out

Explain kernel-level threads (klt), KERNEL-LEVEL THREADS (KLT) In this...

KERNEL-LEVEL THREADS (KLT) In this level every thread management is done by kernel .No thread library except an API system calls to the kernel thread facility exists. The kern

What is a file, Question 1 What is a file? Write down the operations on fi...

Question 1 What is a file? Write down the operations on files Question 2 What do you mean virtual machine? Write down the application of virtual machine Question 3 What

How memory utilization factor shall be computed, How Memory utilization fac...

How Memory utilization factor shall be computed  Memory utilization factor shall be defined as Memory in use/total memory connected

Describe two segment-replacement algorithms, Q. Segmentation is alike to p...

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

What is a two state process model?, What is a two state process model? ...

What is a two state process model?   At any time a process is being implementing by a processor or not. Therefore a process may be in Running or not running state. When an Ope

Operation research, scattered resposibi;ity and authority -necessity of ope...

scattered resposibi;ity and authority -necessity of operation research

What are batch systems?, What are batch systems? Early computers were p...

What are batch systems? Early computers were physically huge machines run from a console. The general input devices were card readers and tape drivers. The common output device

What is scheduler, What is scheduler? A process migrates among the vari...

What is scheduler? A process migrates among the various scheduling queues throughout its life time. The OS must choose processes from these queues in some fashion. This selecti

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