This is the most aggressive algorithm consistent with the rules. Reverse Aggressive Consider the sequences of requests in reverse order. Consider each disk. Takes advantage of distributing load across disks. Theoretical model versus Reality Model uses constant inter-arrival times.
Load balancing is near optimal in the model.
Model does not account for CPU overhead in disk scheduling. Trace-Driven Simulation Real application traces. Used accurate, detailed disk models. Fetching Used optimal offline replacement for demand fetching. All three algorithms are a clear win over demand fetching.