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

Non-repudiation achieved in designing e-cash based system, How can non-repu...

How can non-repudiation be achieved into designing e-cash based system? E-cash is fundamentally an online solution. The buyer should validate the coins by the issuer so as to g

Comparator, 6 bit magnitude comparator

6 bit magnitude comparator

Explain the storage class extern, Explain The Storage Class extern The...

Explain The Storage Class extern The Storage Class extern : One method of transmitting information across blocks and functions is to use external variables. When a variable is

What is the difference between a latch and a flip-flop, What is a flip-flop...

What is a flip-flop? What is the difference between a latch and a flip-flop? List out the application of flip-flop. Ans. Flip-Flop: It is a fundamental memory element utilize

What is the use of cache memory, What is the use of cache memory? The u...

What is the use of cache memory? The use of the cache memories solves the memory access problem. In certain, when a cache is included on the same chip as the processor, access

Determine the purpose of GDTR, Elucidate the purpose of GDTR. If the microp...

Elucidate the purpose of GDTR. If the microprocessor sends linear address 00200000H to paging mechanism, which paging directory entry and which page table entry is accessed? GD

What is the difference among thread and process, Thread is a least unit of ...

Thread is a least unit of process. In process have one or more thread.

Associative array processing, Associative Array Processing Consider tha...

Associative Array Processing Consider that a list of record or a table is stored in the memory and you want to search some information in that list. For example, the list havin

Give example of stack using encapsulation of OOA, Give example of stack usi...

Give example of stack using encapsulation of OOA An example of the Stack.  A Stack abstraction provides methods like pop (), push (), isEmpty(), isFull(). The Stack can be i

Explain the differences between logical and physical address, Explain the d...

Explain the differences between Logical and physical address space Logical Vs physical address space (1) An address produced by the CPU is commonly referred to like a logica

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd