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

what respects the advance builds, Describe your choice specifically and fu...

Describe your choice specifically and fully, explaining and discussing at length in what respects the advance builds upon or departs from present technology or practice and the sev

Structural classification-flynns classification , Structural Classification...

Structural Classification Flynn's classification examine the behavioural concept and does not receive into consideration the computer's structure. Parallel computers can be cla

How can we send data to external programs, How can we send data to external...

How can we send data to external programs? Using SPA/GPA parameters(SAP memory). Using EXPORT/IMPORT data (ABAP/4 memory)

Asp.net, how work for asp.net

how work for asp.net

Explain sample instruction format of mips instruction, Q. Explain Sample In...

Q. Explain Sample Instruction Format of MIPS instruction? All MIPS instructions are of same size and are 32 bits long. MIPS designers chose to keep all instructions of same len

Cheques vs credit cards, Cheques vs Credit Cards E-cheques: E-ch...

Cheques vs Credit Cards E-cheques: E-cheques are used for business dealing in e-commerce. Transactions of these cheques take place on Internet. In this system the elect

What are disadvantages of eprom, What are disadvantages of EPROM? The c...

What are disadvantages of EPROM? The chip must be physically removed from the circuit for reprogramming and its whole contents are erased by the UV light.

Identify the fastest logic gate, Which of the following is the fastest logi...

Which of the following is the fastest logic ECL, TTL, CMOS or LSI ? Ans. The fastest logic is ECL.

Explain significance of init() & destroy( ) method of applet, Explain the s...

Explain the significance of init() and destroy( ) methods of an applet? Also explain two ways of invoking an applet. The init( ) method is utilized for fundamental initializati

Array to be sorted is partitioned again and again, The sorting method where...

The sorting method where array to be sorted is partitioned again and again in such a way that all elements less than or equivalent to partitioning element appear before it and thos

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages