sakras

10 ms·

91.
by sakras 3y ago
How come not all benchmarks appear on all languages? For example, Zig's bar appears to be lower than C's by virtue of sudoku and bedconv being missing.
92.
by sakras 3y ago
I think parent comment meant that progress has accelerated to such a degree that the same amount of innovation will have happened between now and 2029 as happened between 2003 and now.
93.
by sakras 3y ago
> A slower card with double today's RAM would absolutely sell Absolutely, SQL analytics people (like me) have been itching for a viable GPU for analytics for years now. The price/performance just isn't there yet because th
94.
by sakras 3y ago
I resonate hard with this, and I'm glad it's being flagged as a trend. I didn't quite realize how soul-crushing ads were until I got rid of them. Now I'm on YouTube Premium and Twitch Turbo and look forward to getting ri
95.
by sakras 3y ago
I was just thinking that while browsing the language docs. Something like "This is my programming language. There are many like it, but this one is mine".
96.
by sakras 3y ago
I've actually been thinking along similar lines lately but for a different problem: I see a lot of people using the "pimpl" pattern - having an interface heap-allocate an object for you to hide implementation details. With th
97.
by sakras 3y ago
It’s an app for spaced repetition, but it also means “memorization” in Japanese.
98.
by sakras 3y ago
> batch your updates locally to issue fewer of them at least I don’t know why I never thought of this, brilliant!
99.
by sakras 3y ago
> it doesn’t offer tail-call elimination Why not? I’ve heard people say this about C too and I never understood it: LLVM and GCC both have optimization passes that perform tail-call elimination.
100.
by sakras 3y ago
Funny that this comes up - a lot of times while watching YouTube I'll fidget by trying to highlight exactly half of the title. I check whether or not it's half by dragging the highlighted section over the other half. Glad there&#x
101.
by sakras 3y ago
As of Volta, they have independent PCs with a warp optimizer that dynamically groups threads with the same program counter, so branches aren’t nearly as bad as they used to be.
102.
by sakras 3y ago
> serial computation on a fixed dataset that can be threaded per data point. So if I have 32 data points it's only that parallel The general rule of thumb is that within a generation, higher clock speed yields better performance per
103.
by sakras 3y ago
My threads generally don’t share memory inside the runtime. The only time they touch each others’ stuff is when they perform work stealing or memory stealing, and that’s all provided by the CL-Deque
104.
by sakras 3y ago
> contradicts shared-nothing architecture Sort of? The stealing happens very rarely, only when the thread doesn’t have a page. It’s done using relaxed atomics, so synchronization is pretty mild in this case. > bad data locality This w
105.
by sakras 3y ago
Conway’s law at its finest!
106.
by sakras 3y ago
I'm messing around with implementing a parallel runtime system right now^, and I also had to implement a shared-nothing allocator. I ended up making each thread have a Chase-Lev Deque of 2MB pages. If you want to allocate a page, you d
107.
by sakras 3y ago
> The problem with work-stealing is that it means a task can run on one thread, pause, and then be started again on another thread: that’s what it means for the work to be stolen. This means that any state that is used across a yield poi
108.
by sakras 3y ago
Fantastic article! I have a project with a similar arena allocator, so I'll definitely be taking some of these tricks. One thing my allocator does do is organize arenas into a linked list so that you can grow your size dynamically. How
109.
by sakras 3y ago
Was it a 2D game engine? I recall before using Zero I used an engine called ProjectFUN, which is similar to what you described. That was around 2013 though, not 2002.
110.
by sakras 3y ago
Wow you guys wrote Zero Engine? I used it in summer camps at DigiPen a long time ago, I really enjoyed using it and programming in Zilch (I wrote an AI that played a galaga clone!). This Unity fiasco had me wondering how Zero was doing. See
111.
by sakras 3y ago
Feels like if this takes off there'll be an opportunity for arbitrage between TCGPlayer and Mana Pool. I see e.g. All Will Be One is $11.67 on TCGPlayer and $12.40 on Mana Pool. Though I haven't done the math to see what kind of f
112.
by sakras 3y ago
I’ve been really excited about this paper since I went to the presentation at SIGMOD for it. I think the key innovation here is that it’s the first open standard for a format that’s just a simple combination of lightweight encodings. As far
113.
by sakras 3y ago
How does this compiler compare with Flang? I saw it shouted out on the main page but didn't really see any comparisons for why you'd pick one or the other.
114.
by sakras 3y ago
I’ve tried to use it professionally, but always end up switching to my x86 desktop to profile my code, just so I can use V-Tune. It’s missing any kind of deeper statistics such as memory bandwidth, cache misses, branch mispredictions, etc.
115.
by sakras 3y ago
Instruments is not nearly good enough for any serious performance work. Instruments only tells me what percent of time is spent in which part of the code. This is fine for a first pass, but it doesn’t tell me _why_ something is slow. I real
116.
by sakras 3y ago
This is overall very solid. However you have to be careful to not go overboard with this line of reasoning. I've seen people try to explain away inefficient code by inventing a chain of optimizations that the compiler could conceivab
117.
by sakras 3y ago
It's been really cool seeing PRQL come to life! I'm not involved with it, but I still remember the very first HN post about a year ago where it was just a proposal. And look at it now! It's really gaining steam, I'm real
118.
by sakras 3y ago
Just curious, have you tried adding a feature to TinyGrad? Or are you arguing in the abstract because TinyGrad is small? Because I personally have tried, and found the code to be so code-golf and spaghetti-like that I gave up, it just wasn’
119.
by sakras 3y ago
Usually you'd just hash several different elements at once in a vectorized way.
120.
by sakras 3y ago
I think the issue is awareness. The “modern” way to do it is to precompute a table of bit patterns, and use the bottom few bits of the hash to lookup the bit patterns and set them in the Bloom filter. I wrote a blog post about it if you’re

More ›