Fairness in processor scheduling in time sharing systems
Fairness in processor scheduling in time sharing systems
复制标题
分时系统中处理器调度的公平性
DOI：
10.1145/122140.122141
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
D. K. Subramanian
中科院分区：
文献类型：
--
作者：
S. Haldar;D. K. Subramanian
广义上，公平性是指即使请求调度原语是不公平的或随机的，也能在预定的有界时间内保证从一组请求中授予每个请求。从理论上研究了互斥问题解的公平性。近年来，已经提出了许多公平的解决互斥问题的方案。本文提出了一个例子来说明如何公平的概念可以纳入分时系统中的处理器调度。首先分析了分时系统中使用的轮询调度器的一些缺点，然后提出了一种公平的轮询调度器。
Loosely, fairness is the assurance of granting each request, from a set of requests, within a predetermined bounded time even though the request scheduling primitives are unfair or random. The fairness property has been studied, in solutions to the mutual exclusion problem, from theoretical point of view. Many fair solutions to the mutual exclusion problem have been proposed in recent years. This paper presents one illustration to show how the concepts of fairness could be incorporated in processor scheduling in time sharing systems. First, it looks at some shortcomings associated with the round robin scheduler used in the time sharing systems, and then presents a fair version of the round robin scheduler.