logoalt Hacker News

amluto • today at 3:04 PM • 0 replies • view on HN

I note that the kernels they tested are computation-heavy tasks on essentially fixed- and small-sized working sets, possibly even tasks that are efficiently representable without state that gets used an a priori unknown number of times. (LZ4 decode is a bit of an exception - you don’t know how many times a given position will be copied in the usual streaming decoder, but there may well be a different decoder in which you figure out what future tokens look at an output byte before you emit and discard that byte.)

I wonder how well their design works on the kinds of programs that build large data structures and slowly mutate them, or whether their current design even works at all for such problems.

(Don’t get me wrong: lots of useful problems clearly fit their model. And even if there are problems that don’t, I imagine that much of the compute part of a memory-heavy problem would still work well on something much like their design.)