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
Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block

Unix process API The two most important function calls to use when programming with several processes are fork and exec:  fork() creates a copy of current process. It gives


when demand is 24000 units/year, production rate is 48000 units/year, setup cost is rs 200 per setup, carring cost is rs 20 per units/year, and economic batch quantity is 692.8203

What is the use of FIFOs in client-server applications

Q. How could a system be designed to allow a choice of operating systems to boot from? What would the bootstrap program need to do? Answer: Delieve a system that would like to

Question 1: (a) Describe what is meant by Client-server Computing? (b) Distinguish between a server process and a client process. (c) What are the basic characteristics o

Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr

Q. Why might a system utilize interrupt-driven I/O to manage a single serial port however polling I/O to manage a front-end processor such as a terminal concentrator? A

Explain working of the logical file system The logical file system manages metadata information. Metadata contains all of the file-system structure, excluding actual data. It h