Operating Systems Assignment: Process Scheduling and Algorithms

This assignment delves into the core concepts of operating systems, specifically focusing on process scheduling algorithms. The solution analyzes the performance of various scheduling algorithms, including First-Come, First-Served (FCFS), Shortest Job First (SJFS), Shortest Remaining Time Next (SRTN), Priority (preemptive and non-preemptive), and Round Robin (RR). The assignment outlines the execution of these algorithms using a Gantt chart, providing a visual representation of process execution and completion times. Furthermore, the solution includes a bibliography of relevant academic sources, supporting the analysis and providing context for the concepts discussed. The assignment covers key aspects of operating systems, such as process management and scheduling, making it a valuable resource for students studying computer science.

Running head: OPERATING SYSTEMS – ASSIGNMENT 1
Operating Systems – Assignment 1
Name of the Student
Name of the University
Author’s Note

1
OPERATING SYSTEMS – ASSIGNMENT 1
Answer to Question 1:
The set of processes with the length of the CPU burst in milliseconds:
Process Arrival Time Priority Burst time
P1 0 3 10
P2 1 1 1
P3 2 2 2
P4 4 1 3
P5 8 4 4
The process arrives at the order P1, P2, P3, P4, and P5
Gantt chart lines illustrating the execution for the processes using FCFS, SJFS, SRTN, Priority
(Preemptive and Non-Preemptive) and RR (Quantam = 1) is given below:
1. FCFS:
--------------------------------------------------------------------------------------------
| P1 | P2 | P3 | P4 | P5 |
--------------------------------------------------------------------------------------------
0 10 11 13 16 20
2. SJFS:
--------------------------------------------------------------------------------------------
| P1 | P2 | P3 | P4 | P5 |
--------------------------------------------------------------------------------------------
0 10 11 13 16 20

2
OPERATING SYSTEMS – ASSIGNMENT 1
3. SRTN:
--------------------------------------------------------------------------------------------------------------
| P1 | P2 | P3 | P4 | P5 | P1 |
---------------------------------------------------------------------------------------------------------------
0 1 2 4 7 11 20
4. Priority (preemptive):
---------------------------------------------
| P1 | P2 | P3 | P4 | P5 | P4 | P3 | P1 |
---------------------------------------------
0 1 2 3 5 9 10 11 20
5. Priority (non-preemptive):
--------------------------------------------------------------------------------------------
| P2 | P4 | P3 | P1 | P5 |
--------------------------------------------------------------------------------------------
0 1 4 6 16 20
6. RR
------------------------------------------------------------------------------------------------------------
| P1 | P2 | P3 | P4 | P5 | P1 | P3 | P4 | P5 | P1 | P4 | P5 | P1 | P4 | P1 | P1 | P1 | P1 | P1 | P1 |
-------------------------------------------------------------------------------------------------------------
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

3
OPERATING SYSTEMS – ASSIGNMENT 1
Bibliography
Silberschatz, A., Gagne, G. and Galvin, P.B., 2018. Operating system concepts. Wiley.
Sriram, S. and Bhattacharyya, S.S., 2018. Embedded multiprocessors: Scheduling and
synchronization. CRC press.