Scribd
Upload
98 views1 page

Mini Project: Operating Systems/Process and Process Management Mini Project

1. The document describes a mini project to simulate process scheduling algorithms. It involves creating a simulator that reads process parameters from a configuration file and simulates FIFO and Round Robin scheduling with priority. The simulator outputs scheduling statistics for each process. 2. It then tasks determining which scheduling algorithm performed better for CPU-intensive and I/O-intensive processes based on the results. Suggesting ways to improve the scheduling algorithm is also required. 3. The final task is to suggest different scheduling approaches for a database server system and a desktop system and modify the simulator to test the proposed policies.

Uploaded by

ravi3192
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
98 views1 page

Mini Project: Operating Systems/Process and Process Management Mini Project

1. The document describes a mini project to simulate process scheduling algorithms. It involves creating a simulator that reads process parameters from a configuration file and simulates FIFO and Round Robin scheduling with priority. The simulator outputs scheduling statistics for each process. 2. It then tasks determining which scheduling algorithm performed better for CPU-intensive and I/O-intensive processes based on the results. Suggesting ways to improve the scheduling algorithm is also required. 3. The final task is to suggest different scheduling approaches for a database server system and a desktop system and modify the simulator to test the proposed policies.

Uploaded by

ravi3192
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Operating Systems/Process and Process Management

Mini Project

Mini Project
1. Create a simulator for scheduling a given set of processes in user space only. The
simulator should read fr6m a configuration file a set of parameters for each
process: Length of time for which process will execute, priority of the process and
the preferred scheduling policy - FIFO or Round Robin, the time at which the
process executes and if it is a CPU intensive process _or an I/O intensive process.
Apart from this read the quantum of time given to each process and the number of
priority levels for scheduling the process. Now simulate a scheduling algorithm
which uses FIFO/Round Robin with priority based scheduling. At the end of the
run print the following quantities for each process:
a. Number of times the process was scheduled.
b. A timeline for the process containing the state transitions - Ready, waiting,
Running and Terminated and the timestamp for each transition.
c. Time taken to complete the process.
d. Number of times the process waited for I/O.
e. The priority of the process and preferred scheduling algorithm.
After printing the above values print the average time of completion for each
process.
2. From the calculated parameters determine which scheduling algorithm was better
for CPU intensive and I/O intensive processes. Suggest ways in which the
scheduling algorithm can be improved and why?
3. We have two classes of systems for which we want to create an operating system
- the first class is a server meant to be used as a database and another is a desktop
system meant to be used by a home user. Suggest the different approaches you
would take to schedule the processes on types of system and why? Change the
simulator above to calculate of your scheduling policies and comment on the
results obtained.

P.C.P.Bhat/IISc Bangalore

M3/V1/June 04/1

You might also like