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 monolithic and its diagram

The questions ask List four major functions of an OS. My answer: Function 1: Provide a user interface Function 2: Manage files Function 3: Manage hardware Function 4: Manage appli

Define throughput? Throughput in CPU scheduling is the number of processes that are completed per unit time. For long processes, this rate might be one process per hour; for sh

Question: (a) Red Hat Linux is distributed under the Open Source agreement. Explain what you understand by Open Source distribution system. (b) Write a short note on the L

Process Description A process in UNIX is a somewhat complex set of data structures that provides the operating system with all of the information necessary to dispatch and manag

Q. Why is rotational latency typically not considered in disk scheduling? How would you alter SSTF, SCAN and C-SCAN to comprise latency optimization? Answer: Most disks don't

Q. An operating system sustains a paged virtual memory using a central processor with a cycle time of 1 microsecond. It costs an additional one microsecond to access a page other

Q. Explain the File-system manipulation? File-system manipulation there is several details in file allocation, creation, deletion and naming that users should not have to perfo

How is memory management done using bit maps? A bit map is here in this we signify the bit value as 0 or 1. 1-hole 0-process In this we are able to represent the proce

Difference between threads and processes 1. Thread is flow of implementation. Process is group of instruction which is alike to that of a program except which may be stopped an