Department of Computer Science: Compare and Contrast The Common Scheduling Algorithms)
Department of Computer Science: Compare and Contrast The Common Scheduling Algorithms)
CPU scheduling(Part 1)
Compare and contrast the common scheduling algorithms)
Note:- This lab is in groups of 2.You have to submit a single document per group.
Objective
The Objective of this lab is to familiarize yourself with CPU scheduling and program basic
algorithms related to it.
Tools/Software Requirement
Linux (Ubuntu)
GCC
Description:
The process scheduling is the activity of the process manager that handles the removal of the
running process from the CPU and the selection of another process on the basis of a particular
strategy. Process scheduling is an essential part of a Multiprogramming operating systems. Such
operating systems allow more than one process to be loaded into the executable memory at a
time and the loaded process shares the CPU using time multiplexing.
Task # 1
HINT: - you can use array of integers to store burst time, wait time and completion time.
HINT: - you can use array of integers to store burst time, wait time and completion time.
Instructions
You are encouraged to use good programming conventions by entering appropriate comments,
using indentations, and using descriptive variable names in your programs
Deliverables
Upload the document containing source codes as well as screenshots on LMS within lab time.