Revised Formula for Estimating CPU-Burst

Abstract

The purpose of any scheduling algorithm is to arrange processes in ready queue in a manner to produce efficient results in terms of average waiting time, throughput and fairness etc. For this purpose, a number of scheduling algorithms are in existence. SJF is one of them. Though it provides optimal results, yet it is difficult to estimate the processing time of a process needed for its implementation. Present paper modifies average exponential formula and suggests a new computation technique based on fuzzy approximation for knowing CPU requirement of a process.