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.005a" src="https://static.hindawi.com/articles/tswj/volume-2014/940850/figures/940850.fig.005a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Total seek distances</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="940850.fig.005b" src="https://static.hindawi.com/articles/tswj/volume-2014/940850/figures/940850.fig.005b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Throughput</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="940850.fig.005c" src="https://static.hindawi.com/articles/tswj/volume-2014/940850/figures/940850.fig.005c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>Average response time</td></tr></table></td></tr><tr class="fig-image" id="d"><td><img alt="940850.fig.005d" src="https://static.hindawi.com/articles/tswj/volume-2014/940850/figures/940850.fig.005d.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(d) </b>Deadline miss rate</td></tr></table></td></tr></table>

<table>Performance comparison with various workloads.</table>

The Scientific World Journal

fig5

Figure 5

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