Insights, Best Practices and Forward Thinking from the Customer Facing Team, Solution Architects and Leaders on Extreme Performance Applications, Infrastructure, Storage and the Real-World Impact Possible

The Cost of Compromise: #3 I/O Scheduling

by VIOLIN SYSTEMS on January 9, 2013

We’ve been sailing through the top 11 tactics that people engage in to make their storage run faster. Tactics that come with costly side effects.

Yet another tactic we’ve seen is I/O scheduling - pretty self-explanatory. It refers to the concept of operating systems using an I/O scheduler to manage the order in which I/O operations are submitted to the storage. These are complex algorithms that re-order I/O operations so that the movement of disk heads (known as a “seek”) is reduced.

When you direct CPU cycles to reducing seek time, the result is a direct hit on performance. By switching to Violin flash Memory Arrays, the idea of a “seek time” is no longer relevant and the CPU can remain dedicated to executing I/O operations and provide ultra-fast response times.

If you're in the mood to wax philosophical on database workloads, here's a theory to noodle on.