Editing I/O bound (section)

==I/O bound as a practical problem==
The I/O bound state is considered undesirable because it means that the [[central processing unit|CPU]] must stall its operation while waiting for data to be loaded or unloaded from [[main memory]] or [[secondary storage]]. With faster computation speed being the primary goal of new computer designs and components such as the CPU and memory being expensive, there is a strong imperative to avoid I/O bound states and eliminating them can yield a more economic improvement in performance than upgrading the CPU or memory.

''As CPU gets faster, processes tend to get more I/O-bound''

Or in simpler terms:

''As CPU gets faster, processes tend to not increase in speed in proportion to CPU speed because they get more I/O-bound.''

This means that I/O bound processes are slower than non-I/O bound processes, not faster. This is due to increases in the rate of data processing in the core, while the rate at which data is transferred from storage to the processor does not increase with it. As CPU clock speed increases, allowing more instructions to be executed in a given time window, the limiting factor of effective execution is the rate at which instructions can be delivered to the processor from storage, and sent from the processor to their destination. In short, programs naturally shift to being more and more I/O bound.<ref>{{cite web
|author=slebetman
|author-link=slebetman
|url = https://stackoverflow.com/questions/3749208/why-i-o-bound-processes-are-faster
|title=why-i-o-bound-processes-are-faster
|accessdate = 9 August 2014
}}</ref>