|
|||||
|
|
| 时间片随机到达的轮转调度算法分析 | |
| 引用本文： | 李小平,王海波,王守峰. 时间片随机到达的轮转调度算法分析[J]. 哈尔滨理工大学学报, 2001, 6(5): 14-16 |
| 作者姓名： | 李小平 王海波 王守峰 |
| 作者单位： | 1. 哈尔滨理工大学计算机与控制学院, 2. 哈尔滨海关技术处, 3. 哈尔滨气化厂科技实业总公司, |
| 摘 要： | 在用时间片轮转法进行调度实例分析中，分析了到来时刻具有随机性的实际进程，给出了新到来的进程在遵循先来先服务原则下的分析过程，并用具体实例加以比较． |
| 关 键 词： | 操作系统 调度 算法 |
| 文章编号： | 1007-2683(2001)05-0014-03 |
| 修稿时间： | 2001-04-04 |
Shortage of Analysis of Instances Scheduled by the Quantum Round Robin Algorithm |
|
| LI Xiao-ping,WANG Hai-bo,WANG Shou-fend. Shortage of Analysis of Instances Scheduled by the Quantum Round Robin Algorithm[J]. Journal of Harbin University of Science and Technology, 2001, 6(5): 14-16 | |
| Authors: | LI Xiao-ping WANG Hai-bo WANG Shou-fend |
| Affiliation: | LI Xiao-ping1,WANG Hai-bo2,WANG Shou-fend3 |
| Abstract: | Among the analysis process of instances scheduled by the quantum round robin algorithm, the coming process is inserted at the head of the ready queue, which violates the rule of first - come -first- served. In this paper, the processes with stochastic coming time are anlysed. The analysis procedure of new coming process abiding by the rule of first - come - first - served is presented. The two methods are compared by examples. |
| Keywords: | operating system scheduling algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |