w


 w 
  w 

 

²

² 
The project titled ͞Job Scheduling ͟ is the software
developed for the implementing various job scheduling
Algorithm mainly for Shortest job first, Round Robin,
First come First serve basis .The proposed software is
trying to compare various job scheduling algorithm to
measure following points :

1. Average waiting time per job.

2. Average completion time per job.

 

²

The basic objectives of making this Software System
are as follows :-

ͻHere, we will Implement various Job Scheduling

Algorithm.

ͻComparing the algorithm for average Waiting Time and

average completion time.

ͻFinding the best algorithm for a given list of Jobs.

ͻSimulating the Job execution.

ͻTo save the valuable time of the user while

Scheduling the Jobs.
 ›
 

Come, First- Served Scheduling (FCFS):
First-

The process that requests the CPU first, is allocated the CPU first.
These implementation of FCFS, policy is easily managed with a FIFO
Queue.

Shortest ʹJob-First Scheduling:

This algorithm associates with each process whereas the CPU

assumes, that process whose run time is known in advance, in non-
preemptive batch algorithm.
Round-Robin Scheduling :

In this scheduling a small unit of time called time slice is defined.

The CPU scheduler goes around the ready queue, which is treated
as circular queue, allocating the CPU to each process for time
interval of up to one time slice.

Priority Scheduling:

A priority is associated with each process , and the CPU is

allocated to the process with the highest priority.
 á
w   á


á
  á
  
    

     


 
  !"
w #w $
! %&
'( % (
%w %&
)  w %&
w   
ô²²

² 
 Job scheduling limited to Operating System and not for Operation
Research.

The software is not implemented using Threads.

Software is only the Simulation and not the actual execution.

 ô² 
andIttheis very important to complete the job which is required first
job which is shortest.

Thus to Implement all these requirements this project has been

developed using various algorithms.