| ASPFQ:一种简单公平的队列调度算法 |
| |
| 引用本文： | 时培昕,柴洪杰,雷振明. ASPFQ:一种简单公平的队列调度算法[J]. 计算机工程与应用, 2003, 39(12): 36-39 |
| |
| 作者姓名： | 时培昕 柴洪杰 雷振明 |
| |
| 作者单位： | 北京邮电大学信息工程学院ATM中心,北京,100876 |
| |
| 摘 要： | 文章针对SPFQ算法公平性的不足,提出了一种能够根据流的状态变化情况自适应调整公平性的算法ASPFQ,并进行了分析和仿真。这种算法不仅提高了SPFQ的公平性,同时具备了实现简单的特点。
|
| 关 键 词： | 队列调度 势函数 公平性 |
| 文章编号： | 1002-8331-(2003)12-0036-04 |
| 修稿时间： | 2002-12-01 |
ASPFQ :a Simple and Fair Scheduling Algorithm |
| |
| Shi Peixin Chai Hongjie Lei Zhenming. ASPFQ :a Simple and Fair Scheduling Algorithm[J]. Computer Engineering and Applications, 2003, 39(12): 36-39 |
| |
| Authors: | Shi Peixin Chai Hongjie Lei Zhenming |
| |
| Abstract: | This paper discuss es the unfairness of SPFQ,and introduces a new scheduling algorithm called ASPFQ which can revise the fairness adaptively according to the changing of flow states.Then it makes a performance comparison be-tween it and SPFQ and examines it with detailed simulations.It reveals that ASPFQ has a better fairness and a simpler implementation than SPFQ. |
| |
| Keywords: | Scheduling Potential function Fairness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
