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

Assignment, Find the Regular Grammar for the following Regular Expression: ...

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

What is interpreter, What is interpreter? An interpreter is a program ...

What is interpreter? An interpreter is a program that appears to execute a source program as if it were machine language.

State the term- interviewing, State the term- Interviewing This involv...

State the term- Interviewing This involves a one to one question & answer session between analyst and customer/employee. A good method if analyst wants to probe deeply into on

What is morphing, What is Morphing Differences in appearance between ke...

What is Morphing Differences in appearance between key frames are automatically calculated by computer - this is called MORPHING or TWEENING. Animation is ultimately RENDERED (

Give the syntax of if-else statement, Give the syntax of "if-else" and "sw...

Give the syntax of "if-else" and "switch" statements and explain. if else This is used to decide whether to do something at a special point, or to decide between two courses

How do you create special files like named pipes, How do you create special...

How do you create special files like named pipes and device files? The system call method forms special files in the following sequence. Kernel assigns new inode,

What is user defined functions, What is User Defined Functions? User-De...

What is User Defined Functions? User-Defined Functions permit defining its own T-SQL functions that can accept 0 or more parameters and return a single scalar data value or a t

Naïve bayes algorithm for text classification, Assignment 3: Naïve Bayes al...

Assignment 3: Naïve Bayes algorithm for text classification. First part: In this assignment, we will redo the task of classifying documents (assignment 2) using the same R

Discuss briefly subscriber loop system, Discuss briefly subscriber loop sys...

Discuss briefly subscriber loop system. Subscriber Loop System: Every subscriber in a telephone network is connected usually to the nearest switching office using a dedicated

C program , minimum number of shelves

minimum number of shelves

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages