Google details the first vectorized, performance-portable Quicksort
mococa · hn · 2026-09-17
Google's open source blog describes the first vectorized, performance-portable Quicksort, implemented in its C++ parallel library. The design uses SIMD instructions to parallelize partitioning and comparisons while remaining portable across CPU architectures. The HN thread digs into the engineering details and real-world speedups.
More from Infra
- Palmer Luckey asks: can you use datacenter RAM for things prohibited by the operator's terms of service? — avaitopiper · 2026-11-02
- Disable MTP for 20-30% faster local LLM inference on limited RAM — InternalMode8159 · 2026-11-02
- Kioxia up 216% in a year but down 68% from its June 2026 peak — zephyr_z9 · 2026-11-02
- Intel plunges 29%, worst day since the 1970s, wiping $12B off US government stake — emmanuelvivier · 2026-11-02
- Researcher hoards nearly 1TB of DRAM, refuses to sell a stick to data centers — kevinnbass · 2026-11-02
- Self-Hosting LLMs at a Law Firm: Infra and Data Governance Harder Than the Model — EducationalGroup7245 · 2026-11-02