Iteration-sharing in scheduling algorithms of Switch-Memory-Switch architectures
Bin Liu · Journal of Tsinghua University(Science and Technology) · 2008
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.