Rail Road Strategy for SJF Starvation Problem

Abstract

Translate Article

Problem statement: Providing an ageing strategy for Shortest Job First, keeping the waiting time as efficient as possible better than any other algorithm of similar kind. Approach: Relative waiting time and burst time of each process are compared to get an effective scheduling policy in a constant scheduling overhead. Result: Based on experiments and calculations, our algorithm have provided better waiting time than Highest Response Ratio Next (HRRN) in some cases, equal waiting time in most cases, very negligible more waiting time in some cases and a constant scheduling overhead. HRRN was the best known improvement on Shortest Job First till date. Conclusion: Our algorithm can prove very effective for batch processing systems and situations where burst time can be easily predicted.