Algorithms/go-perfbook
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add more notes on napkin estimation for system performance

Browse Source
This commit is contained in:
Damian Gryski 2019-10-31 16:25:58 -07:00
parent c30dc2d410
commit 5bae8ee531
1 changed files with 7 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
performance.md
View File

@ -169,7 +169,13 @@ Dan Luu's previously mentioned talk on [BitFunnel performance
estimation](http://bitfunnel.org/strangeloop) shows an example of using rough estimation](http://bitfunnel.org/strangeloop) shows an example of using rough
calculations to determine if your target performance figures are reasonable. calculations to determine if your target performance figures are reasonable.
TODO: Programming Pearls has "Fermi Problems". Knowing Jeff Dean's slide helps. Simon Eskildsen has a talk from SRECon covering this topic in more depth:
[Advanced Napkin Math: Estimating System Performance from First Principles](https://www.youtube.com/watch?v=IxkSlnrRFqc)
Finally, Jon Bentley's "Programming Pearls" has a chapter titled "The Back of
the Envelope" covering Fermi problems. Sadly, these kind of estimation skills
got a bad wrap thanks to their use in Microsoft style "puzzle interview
questions" in the 1990s and early 2000s.
For greenfield development, you shouldn't leave all benchmarking and For greenfield development, you shouldn't leave all benchmarking and
performance numbers until the end. It's easy to say "we'll fix it later", but performance numbers until the end. It's easy to say "we'll fix it later", but