一种具有O信息复杂度的高速crossbar调度算法.pdfVIP

11 Vol. 34 No. 11 2006 11 ACT A ELECT RON ICA SINICA Nov. 2006 O( logN ) crossbar 彭来献, 田 畅, 赵文栋 ( , 2 10007) : crossbar iRGRR( iterative requestgrantbased roundrobin) , , ( iSLIP[ 1 PIM[ 2 ) . iRGRR O (N ) O ( logN ) , , / . , , iRGRR iSLIP . , iRGRR iSLIP . : ; ; crossbar; ; iRGRR; : TP39305 : A : ( 2006) A New Scheduling Algorithm with O ( logN ) Control Messages Complexity for HighSpeed Crossbars PENG Laixian,T IAN Chang, ZHAO Wendong ( Institute of Communications Engineering , PLA Univers ity of Science and Techno ogy, N anj ing, Jiangsu 2 10007, China ) Abstract: This paper presents a scalable scheduling scheme, called iterative requestgrantbased roundrobin ( i RGRR) , for highspeed crossbars. It overcomes limitation that mo st traditional scheduling schemes ( such as i SLIP, PIM) suff er from poor scala bility by simplifying the execution process and reducing the scheduling overhead . iRGRR dramatically reduces the complexity of contro l messages from an order of O ( N ) to O ( lo gN ) , and thus pro vides f ine scalability , and can be u sed in terabit sw itches/ routers . The simulation results show that iRGRR can achieve nearly the same performance as iSLIP under various traff ic models, in cluding uniform and nonuniform destination distributions . In addition , i RGRR provides better f airness and has low er implementation complexity than iSLIP. Key words: router; in