A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads
Figure 1
An example of grouping best-effort requests located closely to each other. In (a), the number of all possible combinations before grouping is 11 factorial. On the other hand, as in (b), the number of all possible combinations after grouping becomes 6 factorial.
