Why process scheduling algorithm favour i/o bound processes, Computer Engineering

Assignment Help:

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes, but not starve CPU-bound processes?

Ans: This will favor the I/O-bound programs due to the relatively short CPU burst request through them; though, the CPU-bound programs will not starve since I/O- bound programs will relinquish the CPU relatively frequently to do their I/O.

Related Discussions:- Why process scheduling algorithm favour i/o bound processes

Essential features of an algorithm, Necessary features of an algorithm: ...

Necessary features of an algorithm: 1.Input: The algorithm should take zero or more input. 2. Output: The algorithm should generate one or more outputs. 3. Definiteness:

Performance and issues in pipelining-speedup, Performance and Issues in Pip...

Performance and Issues in Pipelining Speedup: Firstly, we get the speedup factor that is we see how much speed up performance we get through pipelining. First we get the

Draw state diagram, Draw the state diagram of a process from its creation t...

Draw the state diagram of a process from its creation to termination, including all transitions, and briefly elaborate every state and every transition. When a process executes

Determine sky wave communication is prone to fading or not, Sky wave Commun...

Sky wave Communication is prone to fading, it is true or false. Ans: It is true that sky wave Communication is prone to fading.

Open system interconnection networking model, Q. Open System Interconnectio...

Q. Open System Interconnection Networking Model? An open system is a model which allows any two different systems to communicate regardless of their underlying architecture. Th

Explain the edge-triggered j-k flip-flop, Explain the Edge-triggered J-K fl...

Explain the Edge-triggered J-K flip-flop? The J-K flip-flop works extremely similar to S-R flip-flop. The merely difference is that this flip-flop has NO invalid state.

Multiple layers of intranet security, Multiple Layers of Intranet Security ...

Multiple Layers of Intranet Security Security requirements vary from organisation to organisation. They also vary on the content that the organisations intend to place on their

Objectives-interconnection network, Objectives After examining this uni...

Objectives After examining this unit, learner's will be able to understand discuss the importance and needs of interconnection network; explain the part of interconn

Explain essential loop in process scheduling, Explain essential loop in Pro...

Explain essential loop in Process Scheduling . The complex part of scheduling is to balance policy enforcement along with resource optimization so as to pick the best job to run

Constraint satisfaction problems, Constraint Satisfaction Problems: Fu...

Constraint Satisfaction Problems: Furthermore I was perhaps most proud of AI on a Sunday. However this particular Sunday, a friend of mine found an article in the Observer reg

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages