Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.



An I/O-bound process is one that spends more of its time doing I/O than it spends doing computations. A CPU-bound process, in contrast, generates I/O requests infrequently, using more of its time doing computations. It is important that the long-term scheduler select a good process mix of I/O-bound and CPU-bound processes. If all processes are I/O bound, the ready queue will almost always be empty, and the short-term scheduler will have little to do. If all processes are CPU bound, the I/O waiting queue will almost always be empty, devices will go unused, and again the system will be unbalanced. The system with the best performance will thus have a combination of CPU-bound and I/O-bound processes
If you want to change selection, open document below and click on "Move attachment"

pdfs

  • owner: miller - (no access) - Abraham Silberschatz_ Peter B Galvin_ Greg Gagne -Operating system concepts-Wiley (2012).pdf, p137
  • owner: hughleat - (no access) - Abraham-Silberschatz-Operating-System-Concepts---9th2012.12.pdf, p137


Summary

statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on

Details



Discussion

Do you want to join discussion? Click here to log in or create user.