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

Interrupts - computer architecture, Interrupts Interrupt-request lin...

Interrupts Interrupt-request line o Interrupt-acknowledge signal o Interrupt-request signal Interrupt-service routine o May have no relationship t

Shared-memory programming model, Q. Shared-memory programming model? In...

Q. Shared-memory programming model? In shared-memory programming model tasks share a common address space that they read and write asynchronously. Several mechanisms like semap

What is arrays pointers, Q. What is Arrays Pointers? An array is a coll...

Q. What is Arrays Pointers? An array is a collection of similar type of data. Arrays are extremely popular data structures in parallel programming because of their easiness of

Explain top-down parsing, Explain Top down parsing. Top down parsing...

Explain Top down parsing. Top down parsing: Specified an input string, top down parsing tries to derive a string identical to this by successive application of grammar rule

Bfbr, Brjrbtjr

Brjrbtjr

Differentiate among validation and exception testing, Differentiate between...

Differentiate between validation and exception testing. - Validation testing is done to test software in conformance to requirements specified. It aims to demonstrate that soft

Three different types of convergences, Three dissimilar types of convergenc...

Three dissimilar types of convergences are: 1. The convergence of e-commerce and wireless technology 2. The Convergence of E-Commerce and IP Business-Grade Messaging 3

Explain the features of major scheduling algorithms, Explain the Features o...

Explain the Features of Major scheduling algorithms. The Features of Major scheduling algorithms is given below: FCFS - i.e. First come first served scheduli

Sorting algorithms, Two way merge sort for 84,83,78,90,23,123,98,159,8,200

Two way merge sort for 84,83,78,90,23,123,98,159,8,200

Stack overflow causes, Stack overflow causes (A) Hardware interrupt. ...

Stack overflow causes (A) Hardware interrupt. (B) External interrupt. (C) Internal interrupt. (D) Software interrupt. Stack overflow occurs whereas execution

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages