Viewing profile — EffCompute

Rochus, your point about LLVM and the 'upper bound' of C optimization is a bit of a bitter pill for systems engineers. In my own work, I often hit that wall where I'm trying to exp…

That benchmark is a great data point, thanks for sharing. The performance parity with unoptimized GCC makes sense, given how much heavy lifting modern LLVM/GCC backends do for C++.…

It's refreshing to see Oberon getting some love on the Pi. There’s a certain 'engineering elegance' in the Wirthian school of thought that we’ve largely lost in modern systems. Whi…

[dead]

I think EnPissant has a point regarding the overhead. Mapping semantic dependencies at the patch layer sounds great in theory, but the computational cost of resolving those graphs …

[dead]

I really agree with jandrewrogers' point about the insularity of the database domain. While working on a custom C++ engine to handle 10M vectors in minimal RAM, I’ve noticed that m…

[dead]

One thing I'm trying to better understand is where the real limits are. At this point it feels like the bottleneck is less about raw compute and more about how efficiently data is …

Not yet — it's still a personal prototype and I'm actively experimenting with different approaches and optimizations. I’m trying to better understand the limits of what’s possible …

Quick update: I've been iterating on the approach and managed to push the coarse search further. Currently seeing ~100M vectors scanned in ~10ms on a single RTX 3090 (binary stage …

I built a prototype GPU-based vector search system that runs locally on a consumer PC. Hardware: RTX 3090 consumer CPU NVMe SSD Dataset: ~70 million vectors (384 dimensions) Perfor…