A Novel Processor Scheduling Schema in Programmable Router Based on Queue Length Thresholds  

作　　者：徐恪 LIN Chuang Wu Jianping 

机构地区：[1]Network Institute, Department of Computer Science, Tsinghua University, Beijing 100084, P.R.China

出　　处：《High Technology Letters》2004年第1期1-7,共7页高技术通讯（英文版）

基　　金：国家自然科学基金

摘　　要：Programmable router may execute computing tasks except for forwarding IP packets. How to schedule the CPU in the programmable router is an important issue that needs to be solved. In this paper, the authors establish general software architecture of programmable router firstly. Based on this architecture, authors present a novel CPU scheduling algorithm based on queue length thresholds. We model this algorithm using stochastic Petri nets. The analytic results show that this scheduling algorithm can guarantee the requirements of computing of best-effort flows and QoS flows in programmable router at the same time.

关 键 词：处理器 时序安排算法 可编程路由器 队列长度门限 CPU PETRI网 QoS流 

分 类 号：TN911[电子电信—通信与信息系统] TP301.6[电子电信—信息与通信工程]