Scribd
Upload
22 views2 pages

FAROUK

Uploaded by

godgiven.ug
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views2 pages

FAROUK

Uploaded by

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

With reference to Peter Brucker's book

Evaluating the performance of process scheduling algorithms involves analysing their efficiency in
managing processes and optimizing system resources. Waiting time is a crucial metric for comparing
the performance of two process scheduling algorithms

Waiting time is a key performance metric in evaluating process scheduling algorithms. It represents t
he total time a process spends in the ready queue waiting to be executed by the CPU. Let's compare
First-Come, First-Served (FCFS) and Shortest Job Next (SJN).

First-Come, First-Served (FCFS)

In FCFS, processes are executed in the order they arrive. This can lead to the "convoy effect," where s
horter processes are delayed behind longer ones.

Example:

Process Arrival Time Burst Time Completion Time Waiting Time

P1 0 4 4 0

P2 1 3 7 3

P3 2 2 9 5

P4 3 1 10 6

Average Waiting Time = (0 + 3 + 5 + 6) / 4 = 3.5

Shortest Job Next (SJN)

In SJN, the process with the shortest burst time is executed first, which minimizes waiting time but ca
n lead to the "starvation" of longer processes if shorter ones keep arriving.

Example:

Process Arrival Time Burst Time Completion Time Waiting Time

P1 0 4 6 2

P2 1 3 5 1

P3 2 2 4 0

P4 3 1 3 0

Average Waiting Time = (2 + 1 + 0 + 0) / 4 = 0.75

These tables illustrate that SJN generally results in lower waiting times compared to FCFS, highlightin
g its efficiency for shorter tasks.

2. Functions of an Operating System

An OS is the backbone of a computer system, managing hardware and software resources. Let's dive
deeper into four key functions:

MUWONGE FAROUK 1703


1. Memory Management:

 The OS allocates memory to processes as needed and deallocates it when no longer


required. This involves managing the system's RAM and ensuring that applications d
on't interfere with each other’s memory space, which could lead to system crashes.

 Virtual memory allows the OS to use disk space to simulate additional RAM, enabling
the running of large applications on limited physical memory.

2. Process Scheduling:

 The OS decides the order of process execution, ensuring efficient CPU utilization. It
manages process priorities and uses scheduling algorithms (like FCFS, SJN, Round-
Robin, etc.) to allocate CPU time.

 It also handles context switching, where the CPU switches from one process to anoth
er, saving the state of the current process and loading the state of the next process.

3. File System Management:

 The OS organizes and manages files on storage devices, using directories and file syst
ems (like NTFS, FAT32, ext4, etc.). This includes creating, reading, writing, and deletin
g files.

 It maintains metadata (file name, size, permissions, etc.) and ensures data security t
hrough access controls.

4. Device Management:

 The OS communicates with hardware devices through their respective drivers, ensuri
ng that peripherals like printers, monitors, and keyboards function correctly.

 It manages device queues, handles interrupts, and ensures smooth input/output ope
rations.

MUWONGE FAROUK 1703

You might also like