TY - GEN
T1 - Providing 100% throughput in a buffered crossbar switch
AU - Shen, Yanming
AU - Panwar, Shivendra S.
AU - Chao, H. Jonathan
PY - 2007
Y1 - 2007
N2 - Buffered crossbar switches have received great attention recently because they have become technologically feasible, have simpler scheduling algorithms, and achieve better performance than a bufferless crossbar switch. Buffered crossbar switches have a buffer placed at each crosspoint. A cell is first delivered to a crosspoint buffer and then transferred to the output port. With a speedup of two, a buffered crossbar switch has previously been proved to provide 100% throughput. We propose what we believe is the first feasible scheduling scheme that can achieve 100% throughput without speedup and a finite crosspoint buffer. The proposed scheme is called SQUISH: a Stable Queue Input-output Scheduler with Hamiltonian walk. With SQUISH, each input/output first makes decisions based on the information from the virtual output queues and crosspoint buffers. Then it is compared with a Hamiltonian walk schedule to avoid possible "bad" states. We then prove that SQUISH can achieve 100% throughput with a speedup of one. Our simulation results also show good delay performance for SQUISH.
AB - Buffered crossbar switches have received great attention recently because they have become technologically feasible, have simpler scheduling algorithms, and achieve better performance than a bufferless crossbar switch. Buffered crossbar switches have a buffer placed at each crosspoint. A cell is first delivered to a crosspoint buffer and then transferred to the output port. With a speedup of two, a buffered crossbar switch has previously been proved to provide 100% throughput. We propose what we believe is the first feasible scheduling scheme that can achieve 100% throughput without speedup and a finite crosspoint buffer. The proposed scheme is called SQUISH: a Stable Queue Input-output Scheduler with Hamiltonian walk. With SQUISH, each input/output first makes decisions based on the information from the virtual output queues and crosspoint buffers. Then it is compared with a Hamiltonian walk schedule to avoid possible "bad" states. We then prove that SQUISH can achieve 100% throughput with a speedup of one. Our simulation results also show good delay performance for SQUISH.
UR - http://www.scopus.com/inward/record.url?scp=47649096140&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47649096140&partnerID=8YFLogxK
U2 - 10.1109/HPSR.2007.4281262
DO - 10.1109/HPSR.2007.4281262
M3 - Conference contribution
AN - SCOPUS:47649096140
SN - 1424412064
SN - 9781424412068
T3 - 2007 IEEE Workshop on High Performance Switching and Routing, HPSR
SP - 166
EP - 173
BT - 2007 IEEE Workshop on High Performance Switching and Routing, HPSR
T2 - 2007 IEEE Workshop on High Performance Switching and Routing, HPSR
Y2 - 30 May 2007 through 1 June 2007
ER -