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

Explain the compiler - computer programming, Explain the Compiler - Compute...

Explain the Compiler - Computer Programming? The Compiler is a program that translates source code into object code. The compiler derives its name from the means it works looki

Automated reservation system, process

process

Sms gateway application, The most important in the project are to develop a...

The most important in the project are to develop application: 1- Web Conference this will help both the jobseeker and employer to meet through web conference and follow the proc

Give an account of issue pertaining in c language, Give an account of the i...

Give an account of the issue pertaining to compilation of if statement in C language Control structures as if cause significant gap in between the PL domain and the execution d

Illustration of cache size of a system, Q. Illustration of cache size of a ...

Q. Illustration of cache size of a system? Cache Size: Cache memory is very costly as compared to main memory and therefore its size is generally kept very small. It has bee

Exit the loop on end-of-file, Continuing in main, write a loop that will re...

Continuing in main, write a loop that will read from the ifstream that reads enough information to create a person object (i.e. first name, last name, and weight). Exit the loop

Provision for data buffering, Data buffering is quite helpful for purpose o...

Data buffering is quite helpful for purpose of smoothing out gaps in speed of processor and I/O devices. Data buffers are registers that hold I/O information temporarily. I/O is pe

Explain about hyper-threading, Q. Explain about Hyper-threading? Non th...

Q. Explain about Hyper-threading? Non threaded program instructions are executed in a single order at a time until the program completion. Presume a program have four tasks nam

Zero address instruction format, Zero address instruction format is used fo...

Zero address instruction format is used for (A) RISC architecture. (B) CISC architecture. (C) Von-Neuman architecture. (D) Stack-organized architecture.

Software, its language base assignment

its language base assignment

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages