论文部分内容阅读
以往SMS(Switch-Memory-Switch)交换结构调度算法因实现复杂度过高而难以应用在高速环境中。该文提出了一种基于迭代共享的并行迭代调度算法(IS-RRM)。通过在迭代过程中同时解决信元的到达和离开冲突,避免了传统算法构造DTC(Departure-Time-Compatible)二分图所需的复杂开销;利用迭代共享技术,使不同时刻到达的信元共享相对较长一段时间的迭代资源,大大减少了单位时隙所需要的迭代次数,降低了调度器的实现复杂度。仿真表明:在端口数为32时,在每个时隙中仅需采用10次迭代,IS-RRM算法便能够取得小于10-8的信元丢失率。IS-RRM算法具有良好的鲁棒性,在突发到达和非均匀到达模型下均能取得良好的性能。
In the past, the switch fabric scheduling algorithm for SMS (Switch-Memory-Switch) was difficult to be applied in a high-speed environment due to the high implementation complexity. This paper proposes a parallel iterative scheduling algorithm based on iterative sharing (IS-RRM). By solving the cell arrival and departure conflicts in the iteration process simultaneously, the complicated overhead required for constructing the DTC (Departure-Time-Compatible) bipartite graph by the traditional algorithm is avoided. By using the iterative sharing technology, the cell sharing in different time slots is relatively The iterative resources for a long period of time greatly reduce the number of iterations required per unit time slot and reduce the implementation complexity of the scheduler. The simulation shows that IS-RRM algorithm can get the cell loss rate less than 10-8 when the number of ports is 32 and only 10 iterations are needed in each time slot. The IS-RRM algorithm has good robustness and achieves good performance under both burst arrival and non-uniform arrival models.