首页 | 本学科首页   官方微博 | 高级检索  
     

可编程路由器中基于缓冲队列长度阈值的处理器调度
引用本文:徐恪,林闯,吴建平.可编程路由器中基于缓冲队列长度阈值的处理器调度[J].电子学报,2001,29(11):1449-1453.
作者姓名:徐恪  林闯  吴建平
作者单位:清华大学计算机系,北京 100084
基金项目:国家自然科学基金 (No .698730 1 2 ),国家重点基础研究发展规划项目 (No .G1 9990 32 70 7),国家 863计划重项目 (No .863 30 6 ZD 0 7 0 1 )
摘    要:可编程路由器除了转发IP分组之外,还需要执行计算任务.如何调度可编程路由器中CPU的处理能力是一个需要解决的重要问题.本文首先建立了一种通用的可编程路由器软件体系结构,在此基础上,提出了一种基于缓冲队列长度阈值的CPU调度算法,采用随机Petri网对算法进行了模型分析和计算.结果表明,该调度算法可以同时保证可编程路由器中的尽力发送流和QoS流的计算需求.

关 键 词:可编程路由器  长度阈值  随机Petri网  
文章编号:0372-2112(2001)11-1449-05
收稿时间:2000-12-22

Processor Scheduling in Programmable Router Based on Queue Length Thresholds
XU Ke,LIN Chuang,WU Jian-ping.Processor Scheduling in Programmable Router Based on Queue Length Thresholds[J].Acta Electronica Sinica,2001,29(11):1449-1453.
Authors:XU Ke  LIN Chuang  WU Jian-ping
Affiliation:Department of Computer Science,Tsinghua University,Beijing 100084,China
Abstract:Programmable router not only forwards IP packets but also executes computing tasks.CPU scheduling in the programmable router is an important open problem till now.In this paper,the authors establish general software architecture of programmable router firstly.Based on the architecture,authors present a novel CPU scheduling algorithm based on queue length thresholds.We model this algorithm using stochastic Petri nets.The analysis results show that the scheduling algorithm can fulfill the requirements of computing of both best-effort flows and QoS flows in programmable router at the same time.
Keywords:programmable router  queue length thresholds  stochastic Petri nets
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号