simd

A detailed analysis of Rust's std::simd::swizzle_dyn implementation, exposing performance shortcomings and proposing optimizations to better leverage hardware shuffle instructions.

A blog post by Mitchell Hashimoto arguing that SIMD (Single Instruction, Multiple Data) is simpler than often assumed, demonstrating a common pattern for using SIMD in loops with Zig examples.

This post discusses the use of SIMD to optimize collision detection for convex hulls in Box3D, particularly using wide SIMD and the Separating Axis Test to improve performance for hulls with many edges.

Gigatoken is an open-source tokenizer that achieves up to 1000x speedup over HuggingFace tokenizers and 100x over Tiktoken, using SIMD and caching optimizations. It supports drop-in replacement for existing tokenizer APIs.

A new runtime for the K and Q programming languages that reimagines execution using SIMD, parallelism, fusion, and compression to better leverage modern hardware.

A blog post describing an efficient method to pack ternary numbers into 8-bit bytes using SIMD-friendly unpacking, achieving 1.6 bits per trit, with applications in LLM weight quantization like BitNet b1.58.

A blog post demonstrates how adding a conditional check that appears useless can dramatically improve loop performance by allowing the CPU's branch predictor to eliminate data dependencies, achieving up to 4x speedup in a specific compression algorithm.

Talos-XII is a CLI simulator for Arknights: Endfield's gacha system, built entirely in Rust with a custom autograd engine and small RL/MLP stack (no external ML frameworks). It uses neural networks for environment modeling and pull-decision policy, and includes sophisticated SIMD dispatch and an open experiment called ACHF for adaptive caching.

l is a new runtime for k4, q, and qSQL that provides transparent SIMD, compressed vectors, and automatic parallelism while maintaining full compatibility with existing code. It targets high-performance computing on Wall Street.

A developer details the process of optimizing a Go file search from 0.75 GB/s to 49 GB/s, leveraging techniques like SIMD and understanding memory hierarchy, including Go 1.26's new `simd/archsimd` package.

After a year of research, a universal 2x performance improvement for all modern JavaScript parsers is being implemented, starting with oxc_parser, which will speed up tools like OXLint, Vite, and Deno, and potentially major browser engines.

CParseC is a single-header C99 library for parser combinators inspired by Haskell's Parsec, offering zero-copy parsing, no hidden allocations, and SIMD-optimized combinators. It aims to provide a flexible, performant alternative to handwritten parsers and lex/yacc tools.

A blog post describing a tiny compiler that demonstrates how to lower data-parallel kernels by converting for loops into vectorized loops with lanes and masks, implemented in ~180 lines of Python.

The paper presents simdjson, the first validating JSON parser capable of processing gigabytes per second on a single core using SIMD instructions, achieving substantial speedups over existing parsers like RapidJSON.

Rust's SIMD abstractions now allow safe usage without unsafe code by leveraging CPU feature tokens introduced in Rust 1.87, enabling concise and portable vector operations.

Modular demonstrates two approaches for computing game fields: using SIMD precomputation or compiling a Mojo kernel to WebAssembly for live browser rendering.

A Mojo program uses 8 SIMD lanes to generate game levels based on GPU thermal fields, with heat creating obstacles and coolant adding boosts.

This article details how Clojure, with the JVM's Vector API and careful optimization, achieved frame rates within 20% of C for a 3D stress test, demonstrating that a dynamic language can approach low-level performance on hot loops.

This paper presents PivCo-Huffman, a new approach to Huffman coding using pivot coding from wavelet trees, enabling high-performance SIMD-friendly encoding and decoding. It consistently outperforms state-of-the-art Huffman codecs and shows how ANS coding can be selectively applied to skewed nodes to approach ANS compression ratios while preserving high decompression speeds.

Blog post analyzing and implementing a SIMD-accelerated version of std::copy_if using AVX-512 instructions on AMD Zen 4, with performance analysis and comparisons to compiler auto-vectorization.