DocumentCode
3144948
Title
Providing 100% Throughput in a Buffered Crossbar Switch
Author
Shen, Yanming ; Panwar, Shivendra S. ; Chao, H. Jonathan
Author_Institution
Polytech. Univ., Brooklyn
fYear
2007
fDate
May 30 2007-June 1 2007
Firstpage
1
Lastpage
8
Abstract
Buffered crossbar switches have received great attention recently because they have become technologically feasible, have simpler scheduling algorithms, and achieve better performance than a bufferiess 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.
Keywords
buffer storage; photonic switching systems; queueing theory; scheduling; Hamiltonian walk schedule; buffered crossbar switch; scheduling algorithm; stable queue input-output scheduler; virtual output queue; Chaos; Delay; Fabrics; Internet; Packet switching; Scheduling algorithm; Switches; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Switching and Routing, 2007. HPSR '07. Workshop on
Conference_Location
Brooklyn, NY
Print_ISBN
1-4244-1206-4
Electronic_ISBN
1-4244-1206-4
Type
conf
DOI
10.1109/HPSR.2007.4281262
Filename
4281262
Link To Document