Calculus and probability determine the performance of a disk drive

The performance of a disk drive depends on the disk scheduling algorithms employed. The mean response time for the scan algorithm and for the first-come first-served algorithm is derived using elementary calculus and probability techniques. The analysis shows that the scan algorithm performs better than the first-come first-served algorithm except at low rates of request for disk access.