A disk scheduling algorithm: SPFF We put forward an optimal disk schedule with $n$ disk requests and prove its optimality mathematically. Generalizing the idea of an optimal disk schedule, we remove the limit of $n$ requests and, at the same time, consider the dynamical arrival model of disk requests to obtain an algorithm, Shortest Path First-fit First (SPFF). This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head-moving distance, it has the stronger globality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows better superiority than other scheduling polices, but also has higher adjustability to meet the computer system’s different demands.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.