Live data from Hacker News

Viewing profile — BeeOnRope

BeeOnRope

HN member
Joined
Mon, Aug 07, 2017, 3:58 PM UTC
HN karma
2,629
Public activity
898 items

About BeeOnRope

No profile information was provided.

Recent public activity

  1. comment
    Comment #49026571

    Do you have any view on why the AI scrapers resulted in a heavier load than existing crawlers from eg search engines? Where they more exhaustive or more frequent?

  2. comment
    Comment #48904810

    It can work when the marginal cost of new capacity is high, compared to existing capacity. E.g., if the marginal cost of supporting 1 kW of new capacity may be X, while the current…

  3. comment
    Comment #47828633

    Wafer area?

  4. comment
    Comment #47308364

    > The most insane part here is that the AMD EPYC 4565p can beat the turin's used on the cloud providers, by as much as 2x in the single core. That is ... hard to believe for a CPU-…

  5. comment
  6. comment
    Comment #47050831

    What I mean is that we look at a function in isolation and see that it doesn't have any "dead code", e.g.,: int factorial(int x) { if (x This doesn't have any dead code in a static…

  7. comment
    Comment #47044308

    Why is that a problem? Inlining and optimization aren't minor aspects of compiling to native code, they are responsible for order-of-magnitude speedups. My point is that it is easy…

  8. comment
    Comment #47044202

    Dead code is extremely common in C or C++ after inlining, other optimizations.

  9. comment
    Comment #47044180

    Relevant section: > Compiler controlled memory: There is a mechanism in the processor where frequently accessed memory locations can be as fast as registers. In Figure 2, if the ad…

  10. comment
    Comment #47015594

    More registers leads to less spilling not more, unless the compiler is making some really bad choices. Any easy way to see that is that the system with more registers can always us…

  11. comment
    Comment #46954466

    User variance? Any evidence?

  12. comment
    Comment #46878760

    How does prek handle pre-push hooks? I.e. how does it determine the list of modified files. This is a long standing sore point in pre-commit, see https://github.com/pre-commit/pre-…

  13. comment
    Comment #46878662

    If you had a shell script hook, yes you would also run that in CI. Are you asking what advantage pre-commit has over a shell script? Mostly just functionality: running multiple hoo…

  14. comment
    Comment #46874044

    They integrate well with CI. You run the same hooks in CI as locally so it's DRY and pushes people to use the hooks locally to get the early feedback instead of failing in CI. Hook…

  15. comment
    Comment #44957710

    Critical section was IIRC built on top of windows manual/auto reset events which are a different primitive useful for more than just mutex but without the userspace coordination as…

  16. comment
    Comment #44661594

    What is a BM?

  17. comment
    Comment #44627365

    What is the point of the intent entry at all? It seems like operations are only durable after the completion record is written so the intent record seems to serve no purpose (unles…

  18. comment
    Comment #44314508

    No there are vanilla 64GB shipping now too, e.g. Crucial CT2K64G56C46S5.

  19. comment
    Comment #43809306

    Writes to the log don't need to be in the order of the producers timestamp, they just need to be in some (and respect ack to produce causality, etc).

  20. comment
    Comment #43563868

    Yes, I rely heavily on ^ and ' in antuin, though that's partly to workaround the relatively poor fuzzy search (in fzf I never even needed those).

  21. comment
    Comment #43499841

    I use Atuin and like it a lot, and sync history across hosts. However, the fuzzy search in Atuin is worse than fzf, which was a downgrade. It just has less effective heuristics/sco…

  22. comment
    Comment #43418480

    What is a late slip?

  23. comment
    Comment #42942259

    Uncontended CAS without carried dependendies on the result (almost always the case in this use case) are similar in performace to atomic add on most platforms. The CAS is the price…

  24. comment
    Comment #42937852

    Yeah exactly, and this is a commonly used trick in concurrent data structures in general. The Java implemenation has the additional twist that they don't use a fixed number of "slo…

  25. comment
    Comment #42719634

    Thanks, you mention explicitly kernel networking right below about the send path: > before flinging them at the kernel as [vectors of] large, contiguous DMA requests, without havin…