摘要
文章提出了WF2Q+调度算法的两种实现模型,即离散模型和离散简化模型。它们是在WF2Q+调度算法数学模型的基础上的高效实现方法。离散模型很好的保持了WF2Q+调度算法数学模型的性能,而且便于硬件实现。离散简化模型在离散模型的基础上进行简化,基本保持了WF2Q+调度算法数学模型的性能,但大大节约了系统资源,易于实现。WF2Q+调度算法的离散模型和离散简化模型非常适合应用于高速核心交换网络中的分组调度。
Two implementation models of WF^2Q＋ scheduling algorithm are presented in this paper： discrete model and discrete simplified model. These two models are efficient implementations based on WF^2Q＋ mathematic model. Compared with the mathematic model, the discrete model well keeps the performance of the WF^2Q＋ algorithm, and is easy to be implemented on hardware. The discrete simplified model is simplified based on the discrete model, and it basically keeps the performance of the WF^2Q＋ algorithm, but greatly reduces the use of system resources, and is easy to be implemented. Both the discrete model and the discrete simplified model are fit for packet scheduling in high-speed core switching networks.
出处
《微电子学与计算机》
CSCD
北大核心
2006年第1期59-63,共5页
Microelectronics & Computer
基金
国家自然科学基金项目(60202005)
关键词
通信与信息系统
公平队列调度
数学模型
离散模型
离散简化模型
Communication and information system,Fair queuing scheduling, Mathematic model, Discrete model, Discrete simplified model
