lab6（stride scheduling）

Stride调度分析

论文链接：Stride Scheduling

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

 

 Resource rights are represented by tickets – abstract, first-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：在一个系统中，所有进