A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="940850.fig.0010a" src="https://static.hindawi.com/articles/tswj/volume-2014/940850/figures/940850.fig.0010a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Synthetic workload</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="940850.fig.0010b" src="https://static.hindawi.com/articles/tswj/volume-2014/940850/figures/940850.fig.0010b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Real workload</td></tr></table></td></tr></table>

<table>Comparison of G-SCAN and complete searching mechanism as a function of the scaling factor.</table>

The Scientific World Journal

fig10

Figure 10

Figure 10: A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads 