Editing I/O bound (section)

==Comparison with CPU-bound==
Assume we have one CPU-bound process and many I/O-bound processes. As the processes flow around the system, the following scenario may result. The CPU-bound process will get and hold the CPU. During this time, all the other processes will finish their I/O and will move into the ready queue, waiting for the CPU. While the processes wait in the ready queue, the I/O devices are idle. Eventually, the CPU-bound process finishes its CPU burst and moves to an I/O device. All the I/O-bound processes, which have short CPU bursts, execute quickly and move back to the I/O queues. At this point, the CPU sits idle. The CPU-bound process will then move back to the ready queue and be allocated the CPU. Again, all the I/O processes end up waiting in the ready queue until the CPU-bound process is done. There is a [[convoy effect]] as all the other processes wait for the one big process to get off the CPU. This effect results in lower CPU and device utilization than might be possible if the shorter processes were allowed to go first.<ref>{{cite book| last1=Silberschatz|first1=Abraham|last2=Galvin|first2=Peter B.|last3=Gagne|first3=Greg|title = Operating System Concepts| volume = 9| year= 2013| publisher= John Wiley & Sons| isbn= 978-1-118-06333-0}}</ref>