CPU Scheduing FCFS, Operating System

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.
Posted Date: 3/3/2014 8:20:17 PM | Location :







Related Discussions:- CPU Scheduing FCFS, Assignment Help, Ask Question on CPU Scheduing FCFS, Get Answer, Expert's Help, CPU Scheduing FCFS Discussions

Write discussion on CPU Scheduing FCFS
Your posts are moderated
Related Questions
Explain how protection is provided for the hardware resources by the operating system. Dual mode operation Sharing system resources needs operating system to make sure

Define what can be used as a criterion for classification of data structures utilized in language processing              Answer: nature of a data structure, lifetime of a dat

Difference between cache and associate memory

discuss unsafe state in operating system

Question: (a) Distinguish between local and active directory Group Policy in Windows Server 2008? (b) Describe the three areas of account Policies that can be managed thro

The code should be nicely formatted with plenty of comments. It should be easy to read, properly The summary section should include three parts: (1) Record the running t

VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process.   50k 40k

Process States A total of nine states are acknowledged by the UNIX system. They are like as follow: User running                                                   Executing

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo

Locality of reference entails that the page reference being made by a process  Locality of reference entails that the page reference being made by a process is similarly to be