Name
Abstract | ||
|---|---|---|
Abstract Round,robin (RR) arbitration is commonly ,used ,for scheduling of cells in high-speed packet switches. In this paper, we present an overlapped RR (ORR) arbiter design that fully overlaps RR polling and cell scheduling. The ORR arbiter achieves 100% throughput even when a cell transfer time is less than a worst case polling, or scheduling, cycle. This is done by scheduling blocks of cells during a cell transfer time. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/LCN.2003.1243193 | LCN |
Keywords | Field | DocType |
packet switching,scheduling,ORR,cell scheduling,cell transfer time,overlapped round robin arbiter,packet switches,polling | Arbiter,Deficit round robin,Fair-share scheduling,Computer science,Scheduling (computing),Parallel computing,Computer network,Polling,Rate-monotonic scheduling,Weighted round robin,Round-robin scheduling | Conference |
ISSN | ISBN | Citations |
0742-1303 | 0-7695-2037-5 | 1 |
PageRank | References | Authors |
0.35 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenji Yoshigoe | 1 | 84 | 13.88 |
| Kenneth J. Christensen | 2 | 569 | 86.17 |
| Allen Roginsky | 3 | 73 | 10.71 |