lab6（stride scheduling）

smmrSangria

于 2019-03-29 14:55:51 发布

阅读量1.7k

点赞数 2

分类专栏： ucore 文章标签： stride lab6 ucore 操作系统调度算法

本文链接：https://blog.csdn.net/Anna__1997/article/details/88891432

版权

Stride调度是一种结合时间片的优先级策略，资源权利由tickets表示，与进程的优先级和时间片分配直接相关。高优先级进程拥有更多tickets，从而在给定时间内获得更多的资源。Stride值与tickets成反比，pass字段则用于指示进程下次选择的时间点。实验展示了通过调整tickets比例，可以精确控制不同进程的调度频率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Stride调度分析

论文链接：Stride Scheduling

在实验中使用的Stride算法是结合时间片的一种优先级调度策略。每一个时间片结束时，选择就绪状态的进程中Pass值最小的进程分配一个时间片，在一个时间段中进程所获得的时间片数量和进程的优先级大致成正比。

Resource rights are represented by tickets – abstract, ﬁrst-class objects that can be issued in different amounts and passed between clients.

Throughput rates for active clients are directly proportional to their ticket allocations. Thus, a client with twice as many tickets as another will receive twice as much of a resource in a given time interval. Client response times are inversely proportional to ticket allocations. Therefore a client with twice as many tickets as another will wait only half as long before acquiring a resource.

resource right：进程获得时间片的权利。

ticket：在一个系统中，所有进