Efficient queuing architecture for a buffered crossbar switch

Authors:
Michael S. Berger
Affiliations:
Department of Communications, Optics and Materials, Technical University of Denmark, Lyngby, Denmark
Venue:
ICCOM'07 Proceedings of the 11th Conference on 11th WSEAS International Conference on Communications - Volume 11
Year:
2007

Citing 5
Cited 0

The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Designing and Implementing a Fast Crossbar Scheduler

IEEE Micro
A Four-Terabit Single-Stage Packet Switch with Large Round-Trip Time Support

HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
Matching output queueing with a combined input/output-queued switch

IEEE Journal on Selected Areas in Communications
Output-queued switch emulation by fabrics with limited memory

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a modified architecture for a buffered crossbar switch that overcomes the memory bottleneck with only a minor impact on performance. The proposed architecture uses two levels of backpressure with different constraints on round trip time. Buffered crossbars are considered an alternative to bufferless crossbars mainly because the latter requires a complex scheduling algorithm that matches input with output. Buffered crossbars require only a simple scheduler that operates independently for each output queue column. The memory amount required for a buffered crossbar is proportional to the square of the number of ports and the round trip time. The proposed architecture reduces the amount of memory in the buffered crossbar without increasing the scheduling complexity.