0. 文件地址
1. MLFQ: Basic Rules
2. Attempt #1: How To Change Priority
2.1 Example 1: A Single Long-Running Job
2.2 Example 2: Along Came A Short Job
In this example, there are two jobs: A, which is a long-running CPU-intensive job, and B, which is a short-running interactive job. Assume A has been running for some time, and then B arrives. What will happen? Will MLFQ approximate SJF for B?
A (shown in black) is running along in the lowest-priority queue (as would any long-running CPU intensive jobs); B (shown in gray) arrives at time T = 100, and thus is inserted into the highest queue; as its run-time is short (only 20 ms), B complet