Empirical Framework to Mitigate Problems in Longer Job First Scheduling Algorithm LJF+CBT

Abstract

as an individualistic entity program and a program in execution requires good scheduling algorithm for its throughput and latency measures. This work made a study of existing process scheduling algorithms and carefully examines the Longest Job First (LJF) algorithm as a key to minimizing the overall Average Waiting Time (AWT) and the Average Turn-Around Time (ATAT) in multiprocessing systems to find ways of making the algorithm popularly usable in the field of computer application and life endeavors. A sample of generated process attributes of burst-time along each process were used to simulate scenario, by a new technique we referred to as Combinational Burst-Time (CBT) to curtail the major problems of starvation of the shorter jobs in queue. CBT as a framework minimized the large numbers of context switching (CS), starvation and reduced convoy problems.