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
What is a Dispatcher? The dispatcher is the module that gives control of the CPU to the process selected by the short- term scheduler. This function includes: Switching

Question : (a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The

what is difference between file descriptor and file pointer?

What is contiguous allocation? Allocation of a group of consecutive sectors for a one file.

Explain the concept of Reentrancy? It is a useful, memory-saving method for multiprogrammed timesharing systems. A Reentrant Procedure is one in which many users can share a si

What is external fragmentation? As process are removed from and loaded to the memory free memory space is bracken into pieces .external fragmentation take place when enough mem

VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process. Here if a 10k process enters we are able to make a space of

advantage and dis advantage of threads

What problems arise if the directory structure is a general graph? Searching for a particular file may result in searching the similar directory many times. Deletion of the fil

Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for