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

Describe the main architectural layers of windows xp, Q. Describe the three...

Q. Describe the three main architectural layers of Windows XP? Answer: (1) The HAL (Hardware Abstraction Layer) creates operating system portability by hiding hardware differ

Intranet, how intranet can make your business effective

how intranet can make your business effective

Define virtual memory, Define Virtual memory Virtual memory is employe...

Define Virtual memory Virtual memory is employed in all major commercial operating systems

How is the NTFS namespace planned, Q. How is the NTFS namespace planned? Ex...

Q. How is the NTFS namespace planned? Explain. Answer: The NTFS namespace is prearranged as a hierarchy of directories where every directory uses a B+ tree data structure to

Peer to peer network and a client server network, Question : a) Describ...

Question : a) Describe the difference between the authentication of a user account on a peer to peer network and a client server network. b) Compare an end user account with

Determine scheduling policy for time-shared operating system, Determine a s...

Determine a scheduling policy that is most suitable for a time-shared operating system   Round-Robin is a scheduling policy that is most suitable for a time-shared operating s

What is mutual exclusion, Question 1 Brief the following distributed compu...

Question 1 Brief the following distributed computing system model Question 2 Explain the components involved in implementation of RPC mechanism Question 3 What is

Explain about interprocess communication, Explain about interprocess commun...

Explain about interprocess communication The cooperating processes communicate with each other via an interprocess communication facility. IPC gives a mechanism to permit proce

Explain tree structured directories structure, Tree structured directories:...

Tree structured directories: This is the main common directory structure. The tree has a root directory as well as every file in the system has a unique path name. A directory

How many disk operations are needed to fetch the i-node, How many disk oper...

How many disk operations are needed to fetch the i-node for the file /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else alo

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