Explain multilevel feedback queue in detail, Operating System

Explain multilevel feedback queue in detail

  • A process can move among the various queues; aging can be executed this way
  • Multilevel-feedback-queue scheduler explained by the following parameters:

- number of queues

- scheduling algorithms for each queue

- method used to verify when to upgrade a process

- method used to verify when to demote a process  

 

Posted Date: 6/6/2013 5:33:35 AM | Location : United States







Related Discussions:- Explain multilevel feedback queue in detail, Assignment Help, Ask Question on Explain multilevel feedback queue in detail, Get Answer, Expert's Help, Explain multilevel feedback queue in detail Discussions

Write discussion on Explain multilevel feedback queue in detail
Your posts are moderated
Related Questions
Compare between the one and two-dimensional memory organizations in terms of the  memory structure,  advantages, and disadvantages.  Which approach would better support the needs o


List two types of system directories A) Device directory:- Describing physical properties of files. B) File directory :- Giving logical properties of the files.

Q. We have stressed the require for an operating system to make efficient use of the computing hardware. When is it suitable for the operating system to forsake this principle and

The procedure for handling the page fault is as follows 1. We check the internal table to verify whether the reference was valid or invalid. 2. If the reference was invalid,

what is multilevel page table and its applications?

Interrupts The hardware mechanism that enables a device to inform the CPU is called an interrupt. The basic interrupt mechanism works as follows. The CPU hardware has a wire kn

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

What is busy waiting? When strict alteration is done there may take place situation like two processes setting their flag as true. Therefore both of the processes have equal pr

Define request edge and assignment edge. Answer:  A directed edge from process Pi to resource type R j is denoted by Pi->j; it signifies that process Pi requested an instance