About this document
Enhanced SJF: Reducing Starvation Risks by Aditya Kumar is a document available to read on EtoBox.
This document summarizes and compares three CPU scheduling algorithms: First Come First Serve (FCFS), Shortest Job First (SJF), and an enhanced version of SJF proposed by the authors. SJF provides the minimum average waiting time but can cause starvation of larger processes. FCFS has the maximum average waiting time as larger processes may monopolize the CPU if they arrive first. The enhanced SJF algorithm aims to provide average waiting times close to SJF while ensuring larger processes do not starve by ru
- Author
- Aditya Kumar
- Language
- EN