Sciweavers

80 search results - page 5 / 16
» Dynamic Scheduling Algorithm for input-queued crossbar switc...
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup
— A good crossbar switch scheduler should be able to achieve 100% throughput and maintain fairness among competing flows. A pure input-queued (IQ) non-buffered switch requires a...
Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
AICT
2005
IEEE
194views Communications» more  AICT 2005»
14 years 1 months ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer
ICNP
2003
IEEE
14 years 1 months ago
Stress Resistant Scheduling Algorithms for CIOQ Switches
Practical crossbar scheduling algorithms for CIOQ switches such as PIM and ¢ -SLIP, can perform poorly under extreme traffic conditions, frequently failing to be workconserving....
Prashanth Pappu, Jonathan S. Turner
TON
2008
72views more  TON 2008»
13 years 7 months ago
Padded frames: a novel algorithm for stable scheduling in load-balanced switches
Abstract-- The load-balanced Birkhoff
Juan José Jaramillo, Fabio Milan, R. Srikan...
TON
2010
107views more  TON 2010»
13 years 2 months ago
Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches
Abstract-- The problem of providing quality of service guarantees for multicast traffic over crossbar switches has received a limited attention, despite the popularity of its count...
Can Emre Koksal