-
19
pages
-
English
-
Documents
-
2014
Description
In this note, we’ll tackle the problem of developing one of the most
well-known approaches to scheduling, known as theMulti-level Feed-
backQueue (MLFQ). TheMulti-level FeedbackQueue (MLFQ) scheduler
was first described by Corbato et al. in 1962 [C+62] in a system
known as the Compatible Time-Sharing System (CTSS), and this
work, along with later work on Multics, led the ACM to award Corbato
its highest honor, the Turing Award. It has subsequently been
refined throughout the years to the implementations you will encounter
in modern systems.
well-known approaches to scheduling, known as theMulti-level Feed-
backQueue (MLFQ). TheMulti-level FeedbackQueue (MLFQ) scheduler
was first described by Corbato et al. in 1962 [C+62] in a system
known as the Compatible Time-Sharing System (CTSS), and this
work, along with later work on Multics, led the ACM to award Corbato
its highest honor, the Turing Award. It has subsequently been
refined throughout the years to the implementations you will encounter
in modern systems.
-
Publié par
-
Publié le
02 janvier 2014
-
Langue
English