Providing 100% throughput in a buffered crossbar switch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 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.

Original languageEnglish (US)
Title of host publication2007 IEEE Workshop on High Performance Switching and Routing, HPSR
Pages166-173
Number of pages8
DOIs
StatePublished - 2007
Event2007 IEEE Workshop on High Performance Switching and Routing, HPSR - Brooklyn, NY, United States
Duration: May 30 2007Jun 1 2007

Other

Other2007 IEEE Workshop on High Performance Switching and Routing, HPSR
CountryUnited States
CityBrooklyn, NY
Period5/30/076/1/07

Fingerprint

Switches
Throughput
Hamiltonians
Scheduling algorithms
Scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Shen, Y., Panwar, S., & Chao, H. J. (2007). Providing 100% throughput in a buffered crossbar switch. In 2007 IEEE Workshop on High Performance Switching and Routing, HPSR (pp. 166-173). [4281262] https://doi.org/10.1109/HPSR.2007.4281262

Providing 100% throughput in a buffered crossbar switch. / Shen, Yanming; Panwar, Shivendra; Chao, H. Jonathan.

2007 IEEE Workshop on High Performance Switching and Routing, HPSR. 2007. p. 166-173 4281262.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shen, Y, Panwar, S & Chao, HJ 2007, Providing 100% throughput in a buffered crossbar switch. in 2007 IEEE Workshop on High Performance Switching and Routing, HPSR., 4281262, pp. 166-173, 2007 IEEE Workshop on High Performance Switching and Routing, HPSR, Brooklyn, NY, United States, 5/30/07. https://doi.org/10.1109/HPSR.2007.4281262
Shen Y, Panwar S, Chao HJ. Providing 100% throughput in a buffered crossbar switch. In 2007 IEEE Workshop on High Performance Switching and Routing, HPSR. 2007. p. 166-173. 4281262 https://doi.org/10.1109/HPSR.2007.4281262
Shen, Yanming ; Panwar, Shivendra ; Chao, H. Jonathan. / Providing 100% throughput in a buffered crossbar switch. 2007 IEEE Workshop on High Performance Switching and Routing, HPSR. 2007. pp. 166-173
@inproceedings{072e818de0624e788212d42c16487124,
title = "Providing 100{\%} throughput in a buffered crossbar switch",
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 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.",
author = "Yanming Shen and Shivendra Panwar and Chao, {H. Jonathan}",
year = "2007",
doi = "10.1109/HPSR.2007.4281262",
language = "English (US)",
isbn = "1424412064",
pages = "166--173",
booktitle = "2007 IEEE Workshop on High Performance Switching and Routing, HPSR",

}

TY - GEN

T1 - Providing 100% throughput in a buffered crossbar switch

AU - Shen, Yanming

AU - Panwar, Shivendra

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

SN - 1424412064

SN - 9781424412068

SP - 166

EP - 173

BT - 2007 IEEE Workshop on High Performance Switching and Routing, HPSR

ER -