BeeOnRope

5 ms·

1.
by BeeOnRope 2mo ago
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.
by BeeOnRope 2mo ago
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 averaged cost of 1 kW provided to existing customers may be
3.
by BeeOnRope 5mo ago
Wafer area?
4.
by BeeOnRope 6mo ago
> 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-bound task. Do you have any open benchmark which can
5.
by BeeOnRope 7mo ago
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 < 0) throw invalid_input(); // compute factorial ... } Thi
6.
by BeeOnRope 7mo ago
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 to say "don't remove my code" while loo
7.
by BeeOnRope 7mo ago
Dead code is extremely common in C or C++ after inlining, other optimizations.
8.
by BeeOnRope 7mo ago
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 address of u is the same as x, then the last load μ-op is a
9.
by BeeOnRope 7mo ago
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 use the same register allocation as the one with fewer, ignori
10.
by BeeOnRope 7mo ago
User variance? Any evidence?
11.
by BeeOnRope 8mo ago
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-commit/issues/860 and also l
12.
by BeeOnRope 8mo ago
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 hooks, running them in parallel, deciding which hooks to run ba
13.
by BeeOnRope 8mo ago
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. Hooks without CI are less useful since they will be constan
14.
by BeeOnRope 1y ago
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 aspect (32 bit value) of futexes.
15.
by BeeOnRope 1y ago
What is a BM?
16.
by BeeOnRope 1y ago
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 (unless it is say much larger).
17.
by BeeOnRope 1y ago
No there are vanilla 64GB shipping now too, e.g. Crucial CT2K64G56C46S5.
18.
by BeeOnRope 1y ago
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).
19.
by BeeOnRope 1y ago
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).
20.
by BeeOnRope 1y ago
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/scoring, e.g. it might find the individual letters of a sh
21.
by BeeOnRope 1y ago
What is a late slip?
22.
by BeeOnRope 2y ago
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 they pay for contention detection, though it would be inter
23.
by BeeOnRope 2y ago
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 "slots" but rather start at 1 and use CAS failure
24.
by BeeOnRope 2y ago
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 having to stop to allocate So I had assumed you were taking ab
25.
by BeeOnRope 2y ago
How does bytes crate, or anyone else, offer zero copy receive from kernel (as opposed to kernel bypass) sockets? As far as I know that is not possible: there's always a copy.
26.
by BeeOnRope 2y ago
I don't think that's "sure" at all. For one thing, only Python code directly calling Python has that option in the first place, often there is another layer of indirection, e.g., Python code which executes a shell script
27.
by BeeOnRope 2y ago
Note that in general calling the venv python directly vs activating the venv are not equivalent. E.g. if the thing you run invokes python itself, it will use the system python, not the venv one in the first case.
28.
by BeeOnRope 2y ago
Well very interesting. I don't really read that as supporting my idea of a renamer limit: seems like the throughput would either be higher (assuming the CQO just goes "for free" in the same rename cycle) or lower and also dep
29.
by BeeOnRope 2y ago
By default they are not thread safe, i.e., they offer the same thread safety as std::map or any stdlib type; however, the map can optionally be made thread safe and is apparently optimized for this usage. Details at: https://gith
30.
by BeeOnRope 2y ago
Really interesting. Normal uops don't work like that, they are always pipelined, so a p06 op with 3-cycle latency would always be 3/0.5, not 3/1. So the 1-throughput strikes me as a renamer limit, not an execution limit. I.e.

More ›