IMPROVED LONGEST JOB FIRST CPU SCHEDULING ALGORITHM (ILJF)
IMPROVED LONGEST JOB FIRST CPU SCHEDULING ALGORITHM (ILJF)
No Thumbnail Available
Date
2016-08
Authors
SHEHU, AISHA ALIYU
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Longest Job First (LJF) is a Scheduling algorithm that assigns processes with longer burst times first before processes with shorter burst times. This often leads to starvation of the shorter processes which in turn affects the performance of the system. An earlier research extended the LJF algorithm with a combinational burst time to curtail the starvation of short processes. However, performance metrics (Average Waiting Time, Average Turn Around Time and Average Response time) were not fully optimized using this combinational burst time extension. After careful study, a new algorithm was proposed (called Improved LJF Scheduling Algorithm) which overcomes limitations of LJF algorithm with combinational burst time. The proposed algorithm was implemented and bench marked against five scheduling algorithms. Results of our experiments showed that the proposed algorithm outperformed other scheduling algorithms by up to 65% for systems that adopt LJF CPU Scheduling Algorithms.
Description
A THESIS SUBMITTED TO THE SCHOOL OF POSTGRADUATE STUDIES,
AHMADU BELLO UNIVERSITY, ZARIA
IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE AWARD OF MASTER OF SCIENCE DEGREE IN COMPUTER SCIENCE
DEPARTMENT OF MATHEMATICS,
FACULTY OF SCIENCE
AHMADU BELLO UNIVERSITY, ZARIA
NIGERIA
Keywords
IMPROVED,, LONGEST JOB,