PROCESS SCHEDULING IN LONGEST JOB FIRST (LJF) ALGORITHM: A Proposed framework for Starvation Problem

No Thumbnail Available
Date
2013-10
Authors
ABDULLAHI, Ibrahim
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Process as an individualistic program in execution forms the bases of everything in the computer system functionality, Central Processing Unit (CPU) becomes the main target of every process execution. The best ordering and sequence of assigning these processes to the CPU becomes the most difficult problem to obtain best performances. This thesis work in the field of CPU scheduling by carefully studying all popular scheduling algorithms thereby proposing an option to the most uncommon scheduling algorithm: Longest Job First (LJF), to compete along side others. The major problem leading to starvation was reduced by proposing a model into the LJF. The model was designed and tested thereby suggesting ways by which LJF could be enhanced to solve parts of the starvation problems, waiting times and context switches.
Description
A Thesis submitted to the School of Postgraduate Studies, Ahmadu Bello University, Zaria In partial fulfilment of the requirements for the Award of Masters Degree in Computer Science. Department of Mathematics, Faculty of Science Ahmadu Bello University, Zaria, Nigeria
Keywords
PROCESS, SCHEDULING, LONGEST, JOB, FIRST, ALGORITHM, Proposed, framework, Starvation, Problem
Citation
Collections