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

Flowchart for stack program using c, .flowchart for stack program using c

.flowchart for stack program using c

Instruction-execution cycle, Problem (a) Using a labelled diagram of ...

Problem (a) Using a labelled diagram of an Instruction-Execution cycle, describe how a CPU executes single machine instructions by referring to the five main operations.

What are the functions of dispatcher, What are the functions of dispatcher?...

What are the functions of dispatcher? There are four fuctions of dispatcher:- A) Equal distribution of transaction load to the work processes. B) Management of buffer a

One of the fault base testing techniques, One of the fault base testing tec...

One of the fault base testing techniques is:- Mutation testing is the fault base testing.

What are different types of log records, What are different types of Log re...

What are different types of Log records? V1 and V2. V1 must be processed before V2. But, we can have more than single V2 logs

What are types of firewalls, What are types of firewalls? There are con...

What are types of firewalls? There are conceptually two types of firewalls as: 1. Network Level 2. Application Level

Write a c program to sort in ascending order of n numbers, Write a C progra...

Write a C program to sort in ascending order of n numbers. # include # include void main() { int a[25],no,i,j,m,t; clrscr(); printf("\nEnter Total number

Requirements for cache simulator, Using your cache simulator and using smal...

Using your cache simulator and using smalltex.din as your memory trace determine the total miss rate, compulsory miss rate, capacity miss rate, and conflict miss rate for the follo

Moral and ethical implications, • Moral and Ethical Implications o Will ...

• Moral and Ethical Implications o Will this be safe to have on the road Will the computers on board be able to handle extreme circumstances • Hazardous conditions o Ex

Explain memory write operation, Q. Explain Memory Write operation? Memo...

Q. Explain Memory Write operation? Memory write operation transfers content of a data register to a memory word M selected by the address. Presume that data of register R1 is t

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages