| 基于迭代共享的SMS交换结构调度算法 | |
| 徐扬 ; 文振焜 ; 刘斌 ; XU Yang ; WEN Zhenkun ; LIU Bin | |
| 2010-05-12 ; 2010-05-12 | |
| 关键词 | 交换结构 路由器 调度算法 共享存储器 switch architecture router scheduling algorithm share memory TN915.05 |
| 其他题名 | Iteration-sharing in scheduling algorithms of Switch-Memory-Switch architectures |
| 中文摘要 | 以往SMS(Switch-Memory-Switch)交换结构调度算法因实现复杂度过高而难以应用在高速环境中。该文提出了一种基于迭代共享的并行迭代调度算法(IS-RRM)。通过在迭代过程中同时解决信元的到达和离开冲突,避免了传统算法构造DTC(Departure-Time-Compatible)二分图所需的复杂开销;利用迭代共享技术,使不同时刻到达的信元共享相对较长一段时间的迭代资源,大大减少了单位时隙所需要的迭代次数,降低了调度器的实现复杂度。仿真表明:在端口数为32时,在每个时隙中仅需采用10次迭代,IS-RRM算法便能够取得小于10-8的信元丢失率。IS-RRM算法具有良好的鲁棒性,在突发到达和非均匀到达模型下均能取得良好的性能。; Current scheduling algorithms in Switch-Memory-Switch (SMS) architectures are too complicated to be used in super-high speed environments. A parallel iterative scheduling algorithm, IS-RRM, was developed that avoids both arrival and departure conflicts through an iterative analysis, without a complex DTC (Departure-Time-Compatible) bipartite graph. Iteration-sharing technology is used to greatly reduce the number of iterations in each time slot, which reduces the implementation complexity. Simulations show that with 32 switches, the algorithm achieves a cell loss rate of 10-8 with only 10 iterations in each time slot. The algorithm is robust to traffic arrival patterns, achieving very low cell loss rates even with bursts of non-uniform traffic. |
| 语种 | 中文 ; 中文 |
| 内容类型 | 期刊论文 |
| 源URL | [http://hdl.handle.net/123456789/28427]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | 徐扬,文振焜,刘斌,等. 基于迭代共享的SMS交换结构调度算法[J],2010, 2010. |
| APA | 徐扬,文振焜,刘斌,XU Yang,WEN Zhenkun,&LIU Bin.(2010).基于迭代共享的SMS交换结构调度算法.. |
| MLA | 徐扬,et al."基于迭代共享的SMS交换结构调度算法".(2010). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论