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
Question: OS Installation / File system a) Why is NTFS portioning preferred over FAT16 or FAT32 when security is of primary concern? b) State a situation or an application w

Symmetric multiprocessing To get maximum reliability and efficiency a mode of function called as symmetric multiprocessing is used. In essence, with SMP any program or threads

Q. Timers could be utilized to compute the current time. Provide a little description of how this could be accomplished. Answer: A program could utilize the following ap

Define properties of Time sharing operating system Time sharing:- T his systems uses CPU scheduling and multiprogramming to provide economical interactive use of a system. The

Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.

Ask question #Minimum 100 difference between bounded and unbounded buffer words accepted#

what is meant by lazzy swapper

explain the link between operations management and strategic planning of daily goods shop

Synchronization In communication among processes messages passed may be blocking or nonblocking - also called as synchronous and asynchronous. Blocking send : The sending pr

Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p