Sesse__

46 ms·

541.
by Sesse__ 2y ago
I see Amdahl's Law as an opportunity, not a limit. :-) If you optimize something, it means the remainder is now even more valuable to optimize, percentage-wise. In a way like compound interest.
542.
by Sesse__ 2y ago
The big difference is whether the CLAT part is in the CPE or in the endpoints, right?
543.
by Sesse__ 2y ago
> At that point, just use dual stack, even if it's just CG-NAT. The motivating factor is the ability to turn off IPv4 within your own core network. For a large-ish ISP, running v6-only to all of your customers and having IPv4 to onl
544.
by Sesse__ 2y ago
Interesting, I had IPv6 on a “beta” Swisscom in 2016 or so. Crazy that it's taken them to long to productionalize it.
545.
by Sesse__ 2y ago
> E.g. you could have done 10s or 100s of "small optimizations" but yet there is no measurable impact on the E2E runtime performance. My experience actually diverges here. I've had cases where I've done a bunch of opt
546.
by Sesse__ 2y ago
It really depends on your benchmark and how much bias you're willing to trade for your variance. I mean, SQLite famously uses Callgrind and claims to be able to measure 0.005%; which they definitely can, but only in the CPU that Callgr
547.
by Sesse__ 2y ago
> In theory yes, and for sufficiently large N (samples). Sometimes you cannot afford to reach this "sufficiently large N" condition. I think at that point, we should get better at saying “OK, we just don't know”. If I can&
548.
by Sesse__ 2y ago
You might be interested in n2, from the author of ninja.
549.
by Sesse__ 2y ago
Incremental builds of projects with several large binaries (the examples the README gives are MySQL, Clang and Chromium).
550.
by Sesse__ 2y ago
He doesn't specify what file system he's using, but offhand, you would assume that what actually takes time isn't to creating the file, but rather allocating all the blocks. A good first step would be to reproduce the issue a
551.
by Sesse__ 2y ago
> In my experience multi-run benchmarking frameworks which use non-parametric statistics should be the default tool of choice unless you know the particular benchmark is exceptionally well behaved. Agreed. Do you have any suggestions? :-
552.
by Sesse__ 2y ago
> Final conclusion: A network is as strong as the weakest link. Final conclusion: Do not trust a device just because it happens to be on your local network.
553.
by Sesse__ 2y ago
> But they still interact with frequencies lower than 20khz right? No. Different frequencies don't generally “interact”, that's much of the point of frequency analysis. > Think about it like this - I have a single steady saw
554.
by Sesse__ 2y ago
Yes, I have. I work on browser CSS performance.
555.
by Sesse__ 2y ago
The carbon cost of a bloated CSS framework isn't the build time, it's the billions of times the resulting CSS has to be parsed and applied on the web pages where it's used.
556.
by Sesse__ 2y ago
The handshake doesn't primarily depend on AES; it is typically a Diffie-Hellman variant (which doesn't have any acceleration) that takes time. Anyway, you're hopefully using TLS 1.3 by now, where you can use ChaCha20 instead
557.
by Sesse__ 2y ago
> This is not included in the core of hyperfine, but we do have scripts to compute "advanced" statistics, and to perform t-tests here: https://github.com/sharkdp/hyperfine/tree/master/scripts
558.
by Sesse__ 2y ago
Well, even without taking into account that 32-bit systems are increasingly becoming extinct, it's less catastrophic than one might think. You get four muls instead of one and then a little carry propagation; I guess less if you have 3
559.
by Sesse__ 2y ago
I've only seen such things in internal tools so far, unfortunately, so if you see anything in public, please tell me :-) I'm just confused why everything thinks hyperfine is so awesome, when it does not meet what I'd consider
560.
by Sesse__ 2y ago
> Hyperfine is great. Is it, though? What I would expect a system like this to have, at a minimum: * Robust statistics with p-values (not just min/max, compensation for multiple hypotheses, no Gaussian assumptions) * Multiple
561.
by Sesse__ 2y ago
> This type of thing is why I take Casey's claims with a huge dose of salt. My impression in general is that Casey is a fairly decent engineer who has somehow been elevated into godhood by a subset of users.
562.
by Sesse__ 2y ago
You can't hear ultrasound. For audio, the only question about 20+ kHz frequencies is how to get rid of them in the cheapest+best way.
563.
by Sesse__ 2y ago
It also doesn't really mention how this “lost” material was identified. If you just subtract the encoded from the original, then any phase difference will make it sound like material “disappeared”, while in reality, it just came very s
564.
by Sesse__ 2y ago
Sure, you can implement the pre-sampling filter as a multistage filter, of which some of the stages are digital, if you wish. (I don't know where you get “rejecting from 22050 and up” from, though. For the pre-sample filter, you should
565.
by Sesse__ 2y ago
You're mixing up the two filters. The pre-sample filter (before ADC) is defined to be a brickwall (of course impossible in practice, so in reality, it will have to start going off a bit before 20 kHz); the reconstruction filter (after
566.
by Sesse__ 2y ago
> Garbage has to be way up above 28KHz before it starts to fold over into the audible region, too. You brick-wall everything at 20 kHz (with an analogue filter) before you sample it; that's part of the CD standard, and generally als
567.
by Sesse__ 2y ago
No, 44 kHz is because you want to reconstruct the (20 kHz) bandlimited signal and it's (much) easier to realize such a filter if you have a bit of a transition band.
568.
by Sesse__ 2y ago
Well, it's not even the best AES-NI hash on the list (for large nor small inputs), and it's not passing the quality tests, so why bother?
569.
by Sesse__ 2y ago
Not sure why people keep claiming it's the “fastest” when it's far down the list on the SMHasher benchmark list: https://rurban.github.io/smhasher/doc/table.html In particular, rapidhash is three times a
570.
by Sesse__ 2y ago
AFAIK there are rather few query optimizers that can do this; it's not an easy problem, in part because your search space explodes. There's a 2014 paper that addresses this ( https://madoc.bib.uni-mannheim.de/37228&

More ›