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 comple
理解多级反馈队列调度:实例解析与问题讨论

本文深入探讨了多级反馈队列(MLFQ)调度策略,通过不同示例分析其行为,包括单一长运行任务、短任务的插入以及I/O影响。还讨论了当前MLFQ存在的问题,如饥饿和调度器操纵。作业涉及模拟不同场景,调整参数以实现类似轮转调度的行为,并研究如何确保长时间运行的任务获得至少5%的CPU时间。
最低0.47元/天 解锁文章
2367

被折叠的 条评论
为什么被折叠?



