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

<table>The effect of grouping in G-SCAN.</table>

The Scientific World Journal

fig4

Figure 4

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