3 ms·
To be fair, rocket science is also hard, but not very much when all you plan to do is hitting a barn door with fireworks. Same with prime factorization when the
by anyfoo 4y ago
To be fair, rocket science is also hard, but not very much when all you plan to do is hitting a barn door with fireworks. Same with prime factorization when the number to factor is “15”, spontaneously sketching out the pole-zero diagram of f(x)=0… you get the gist.
Usually when people talk about a topic being hard, they don’t mean the very constrained cases that are easy.
- bombcar 4y agoIt’s amusing because rocket science is pretty easy. Rocket mechanics is the tricky part.
- rapind 4y agoRocket scientists can be heard saying "It's not like it's cache invalidation!".
- PaulHoule 4y agoIt's the other way around. 90% of the cases are easy cases, where thinking too hard about invalidation (as opposed to testing what works) is likely to give you worse performance. There are a rare set of cases that are devilishly hard such as synchronizing the caches across an SMP microprocessor or making a system like Cloudflare really speed up your web site as opposed to slowing it down.
- rapind 4y ago> 90% of the cases are easy cases I'll second this. For example, I can usually get away with simple and short lived TTL caches in varnish (with grace) for high traffic read only APIs. Flushing (invalidation) is automated since it just expires. It doesn't always fit, but often it does.
- tybit 4y agoWhen it comes to cache invalidation worse performance isn’t the primary concern in most cases, correctness is.