期刊文献+

输入排队中调度算法的研究 被引量:1

Scheduling Algorithm Research Based on Input Queue
在线阅读 下载PDF
导出
摘要 基于输入排队策略的路由器具有良好的可扩展性,但需要一个有效的调度算法的支持,才能保证吞吐率和延迟等性能。文章对一些典型的输入排队调度算法进行了分析,为输入排队调度算法的进一步研究提出了新的思路和方向。 Input-queued router is referred to as an ideal structure in terms of scalability. However, it needs an efficient scheduling algorithm to guarantee throughput and delay. This paper analyzes some typical scheduling algorithms based on IQ and proposes the new direction and method for further research of IQ scheduling algorithms.
出处 《信息工程大学学报》 2006年第2期137-140,共4页 Journal of Information Engineering University
基金 国家863课题资助项目(2003AA103510)
关键词 调度算法 最大权重匹配 最大匹配 虚拟输出排队 scheduling algorithm MWM MSM VOQ
  • 相关文献

参考文献18

  • 1Stoica I,Zhang H.Exact Emulation of an Output Queuing Switching by a Combined Input Output Queuing Switch[C]∥ Presented at 6th IEEE/IFIP IWQoS'98.Napa,California,1998,5:218-224.
  • 2Chang C S,Chen W J,Huang H Y.On service guarantees for input buffered crossbar switches:A capacity decomposition approach by Birkhoff and von Neumann[C]∥ In IEEE IWQoS'99.London:UK 1999:79-86.
  • 3Altman E,Liu Z,Righter R.Scheduling of an input-queued switch to achieve maximal throughput[J].Probability in the Engineering and Informational Sciences,2000,14:327-334.
  • 4Birkhoff G.Tres observaciones sobre el algebra lineal[J].Univ.Nac.Tucum an Rev.Ser.A,1946,5:147-151.
  • 5Neumann J von.A certain zero-sum two-person game equivalent to the optimal assignment problem[J].Contributions to the Theory of Games,Princeton:Princeton University Press New Jersey,1953,2:5-12.
  • 6Dai J,Prabhakar B.The throughput of data switches with and without speedup[C]∥ Proceedings of IEEE INFOCOM'00.Tel Aviv,Israel,March 2000:556-564.
  • 7Adisak Mekkittikul,Nick McKeown.A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches[C]∥.IEEE Infocom 98,San Francisco.1998,792-799.
  • 8McKeown N,Anantharam V,Walrand J.Achieving 100% throughput in an 5input-queued switch[C]∥ Proceedings of INFOCOM,San Francisco,1996 1:296-302.
  • 9Hopcroft J E,Karp R M.An n2.5 algorithm for maximum matchings in bipartite graphs[J].SIAM Journal on Computing,1973,2(4):225-231.
  • 10Anderson T,Owicki S,Saxe J,Thacker C.High speed switch scheduling for local area networks,[C]∥ ACM Trans.on Computer Systems 1993.11:319-352.

同被引文献7

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部