November 2022
Intermediate to advanced
594 pages
25h 21m
English
| Number | Principle | Used In/Networking Example |
|---|---|---|
| P1 | Avoid obvious waste | Zero-copy interfaces |
| P2 | Shift computation in time | |
| P2a | Precompute | Application device channels |
| P2b | Evaluate lazily | Copy-on-write |
| P2c | Share expenses, batch | Integrated layer processing |
| P3 | Relax system requirements | |
| P3a | Trade certainty for time | Stochastic fair queueing |
| P3b | Trade accuracy for time | Switch load balancing |
| P3c | Shift computation in space | IPv6 fragmentation |
| P4 | Leverage off system components | |
| P4a | Exploit locality | Locality-driven receiver |
| P4b | Trade memory for speed | Processing; Lulea IP lookups |
| P4c | Exploit existing hardware | Fast TCP checksum |
| P5 | Add hardwareg | |
| P5a | Use memory interleaving and pipelinin | Pipelined IP lookups |
| P5b | Use wide word parallelism ... |
Read now
Unlock full access