基于服务时间的加权公平队列调度算法  

Weighted Fair Queuing Schedule Algorithm Based on Service Time

作　　者：马骏[1] 杨功流[1,2] 

机构地区：[1]天津大学机械工程学院,天津300072 [2]天津市航海仪器研究所,天津300131

出　　处：《计算机工程》2009年第16期35-38,共4页Computer Engineering

基　　金：天津市科技发展计划基金资助重点项目(043185111-14)

摘　　要：针对已知存储系统调度算法无法保证服务资源公平分配的问题,提出一种基于服务时间的加权公平队列调度算法,该算法直接采用访问请求的服务时间作为服务资源分配的依据,其公平性非常接近于公平调度算法的理论极限,在负载波动的情况下仍能保持资源分配的稳定性。Aiming at the problem that existing algorithms of modern storage systems can not adapt to the special storage systems environment, this paper proposes a Service Time Based Weighted Fair Queuing（STB-WFQ） schedule algorithm which assigns the service resource of storage systems directly based on the service time of every request. Compared with other methods, the algorithm is the fairest in the storage environment. Its performance is very close to the theory limit of the fair schedule algorithms, and can maintain stabilization when the workload of the storage systems is changed.

关 键 词：存储系统 加权公平队列 服务时间 资源分配 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]