1999
DOI: 10.1109/49.772435
|View full text |Cite
|
Sign up to set email alerts
|

On the speedup required for work-conserving crossbar switches

Abstract: Abstract-This paper describes the architecture for a workconserving server using a combined I/O-buffered crossbar switch. The switch employs a novel algorithm based on output occupancy, the lowest occupancy output first algorithm (LOOFA), and a speedup of only two. A work-conserving switch provides the same throughput performance as an output-buffered switch. The workconserving property of the switch is independent of the switch size and input traffic pattern. We also present a suite of algorithms that can be … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
53
0

Year Published

2000
2000
2020
2020

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 100 publications
(54 citation statements)
references
References 15 publications
1
53
0
Order By: Relevance
“…To cope with the segmentation overhead and the scheduler inefficiencies of unbuffered crossbars, switches and routers use internal speedup [5] -often by a factor of two to three in commercial products. 1 This speedup is very expensive: today, the crossbar chip power consumption is often the limiting factor for the aggregate performance of the system, and power consumption translates directly into (mostly I/O) throughput.…”
Section: Introductionmentioning
confidence: 99%
“…To cope with the segmentation overhead and the scheduler inefficiencies of unbuffered crossbars, switches and routers use internal speedup [5] -often by a factor of two to three in commercial products. 1 This speedup is very expensive: today, the crossbar chip power consumption is often the limiting factor for the aggregate performance of the system, and power consumption translates directly into (mostly I/O) throughput.…”
Section: Introductionmentioning
confidence: 99%
“…Consider the following definition, which was first proposed in [12] motivated from the classical queueing theory.…”
Section: Work Conservationmentioning
confidence: 99%
“…Unfortunately the perfect emulation of OQ requires complicated stable-marriage style algorithms which are not feasible to implement at a very high-speed. In [12] it was shown that simpler scheduling algorithms can achieve the same performance of an OQ switch in terms of average delay.…”
Section: Introductionmentioning
confidence: 99%
“…This problem requires a central scheduler to coordinate the set of input/output pairs (flows, or connections) that will be in the crossbar in each time-slot [1] [2] [3]; this is a complex task that can limit the switch packet rate. Heuristic algorithms that have been adopted today work well only when internal speedup is used to compensate for their scheduling inefficiencies [4]. Because these algorithms operate only on fixed-size units, additional speedup is needed when external packets have variable size, to compensate for segmentation padding.…”
Section: Introductionmentioning
confidence: 99%