Suppose that an operating system supports two kinds of sequential processes: high-priority interactive processes, and low-priority non-interactive processes. The behavior of the high-priority processes is to alternate between periods of computation of duration Tc and periods of blocking (waiting for input) of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
Suppose that an
of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler
selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
Introduction of Operating System:
An operating system (OS) is a collection of software that manages the hardware and software resources of a computer system and provides common services to applications. It acts as an intermediary between applications and the computer's hardware, allowing the application to run without the need for the user to be aware of the underlying details of the hardware.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
