Sciweavers

201 search results - page 1 / 41
» An Improved Algorithm for CIOQ Switches
Sort
View
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 4 months ago
An Improved Algorithm for CIOQ Switches
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
Yossi Azar, Yossi Richter
IEICET
2006
77views more  IEICET 2006»
13 years 11 months ago
Efficient Scheduling for SDMG CIOQ Switches
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
Mei Yang, Si-Qing Zheng
ISCC
2003
IEEE
14 years 4 months ago
Pipelined Maximal Size Matching Scheduling Algorithms for CIOQ Switches.
In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output qu...
Mei Yang, Si-Qing Zheng
ICNP
2003
IEEE
14 years 4 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