5. Chuck Norris Has Died (variety.com)

Chuck Norris, the martial arts champion who became an iconic action star and led the hit series "Walker, Texas Ranger," died March 19 at 86.

7. Our Commitment to Windows Quality (blogs.windows.com)

Hello Windows Insiders,

I want to speak to you directly, as an engineer who has spent his career building technology that people depend on every day. Windows touches more people

9. The Los Angeles Aqueduct Is Wild (practical.engineering)

[Note that this article is a transcript of the video embedded above.] On the northern edge of Los Angeles, fresh water spills down two stark concrete chutes perched on the foothills of the San Gabriel Mountains, a place simply called The Cascades. It’s a deceptively simple-looking finish line: the

10. Claude Code: Channels (code.claude.com)

Use channels to push messages, alerts, and webhooks into your Claude Code session from an MCP server. Forward CI results, chat messages, and monitoring events so Claude can react while you're away.

13. Ghostling (github.com)

A minimum viable terminal emulator built on top of the libghostty C API. Ex minimo, infinita nascuntur. 👻🐣 - ghostty-org/ghostling

21. Attention Residuals (github.com)

Contribute to MoonshotAI/Attention-Residuals development by creating an account on GitHub.

22. Java Is Fast. Your Code Might Not Be (jvogel.me)

Fixing common Java anti-patterns took an app from 1,198ms to 239ms. Eight patterns that compile fine and pass code review but silently drain CPU and balloon heap, with benchmarks and code fixes for each

28. Flash-KMeans: Fast and Memory-Efficient Exact K-Means (arxiv.org)

$k$-means has historically been positioned primarily as an offline processing primitive, typically used for dataset organization or embedding preprocessing rather than as a first-class component in online systems. In this work, we revisit this classical algorithm under the lens of modern AI system design and enable $k$-means as an online primitive. We point out that existing GPU implementations of $k$-means remain fundamentally bottlenecked by low-level system constraints rather than theoretical algorithmic complexity. Specifically, the assignment stage suffers from a severe IO bottleneck due to the massive explicit materialization of the $N \times K$ distance matrix in High Bandwidth Memory (HBM). Simultaneously, the centroid update stage is heavily penalized by hardware-level atomic write contention caused by irregular, scatter-style token aggregations. To bridge this performance gap, we propose flash-kmeans, an IO-aware and contention-free $k$-means implementation for modern GPU workloads. Flash-kmeans introduces two core kernel-level innovations: (1) FlashAssign, which fuses distance computation with an online argmin to completely bypass intermediate memory materialization; (2) sort-inverse update, which explicitly constructs an inverse mapping to transform high-contention atomic scatters into high-bandwidth, segment-level localized reductions. Furthermore, we integrate algorithm-system co-designs, including chunked-stream overlap and cache-aware compile heuristics, to ensure practical deployability. Extensive evaluations on NVIDIA H200 GPUs demonstrate that flash-kmeans achieves up to 17.9$\times$ end-to-end speedup over best baselines, while outperforming industry-standard libraries like cuML and FAISS by 33$\times$ and over 200$\times$, respectively.

Article Details

Browse by Date

Type to search HN and engineering blog articles
Press Escape to close  |  ↑↓ to navigate  |  Enter to open