Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 1

http://www.docstoc.com/docs/21581350/MULTIPLE-CHOICE-QUESTIONS-IN-DBMS http://cs.stackexchange.com/questions/1106/which-queue-does-the-long-term-scheduler-maintain http://www.slideshare.net/Ghaffar/introductiont-to-araytreestack-queue-presentation http://ecomputernotes.com/computernetworkingnotes http://www.zentut.com/data-mining/data-mining-techniques/ http://ecomputernotes.com/fundamental/disk-operating-system/types-of-operating-system http://www.ee.surrey.ac.uk/Projects/Labview/gatesfunc/index.

html#example

Aging (scheduling)
From Wikipedia, the free encyclopedia Jump to: navigation, search This article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style.
(August 2011)

In operating system task scheduling, aging is the process of gradually increasing the priority of a task, based on its waiting time. The aging technique estimates the time a process will run based on a weighted average of previous estimates and measured values.[1] Aging can be used to reduce starvation of low priority tasks.[2] Aging is used to ensure that jobs in the lower level queues will eventually complete their execution.

You might also like