| Intuition for Theorem 5 |
|
|
|
|
|
|
|
|
|
|
| v | The
algorithm replenishes the queue which is going to be in |
||||||||
| the
most urgent need of replenishment |
|||||||||
| Ř | If we use a lookahead buffer to know the requests “in advance”, |
||||||||
| we can identify the queue which will empty earliest |
|||||||||
| Ř | This increases the pipeline latency from when a request is made |
||||||||
| until the byte is available. |
|||||||||
|
|
|
|
| Example: |
|||
| 1. | 160Gb/s line card, b=2560, Q=128: SRAM = 160kBytes, |
||
| latency is 8ms. |
|||
| 38 |