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

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

Q. Explain about Spooling? Acronym for simultaneous peripheral operations on line. Spooling denotes to putting jobs in a buffer, a special area in memory or on a disk where

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo

Q. The RC 4000 system as well as other systems have defined a tree of processes (called a process tree) such that all the descendants of a process are given resources (objects) as

What is preallocation? Why do it? Allocating space for a file before making the file to allow for expansion. This reserves space for a certain file so that other files can't gr

Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta

What disadvantages are there to this two-level directory? Without other provisions, two users who require cooperating with each other are hampered in reaching every other's fi

Safety algorithm : This is to make sure if the system is in safe state or not. It may need an order of m x n2 operation to determine if the state of the system is safe or not.

How free-space is managed using bit vector implementation? The free-space list is implemented as a bit map or bit vector. Each block is shown by 1 bit. If the block is free, th