mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Communication and media
daw
real-time audio engine / DAW
Ableton, Reaper
System
Techniques · 6
Primitives · 25
daw
Work-stealing deque
concurrency · medium: Per-worker deque: the owner pushes and pops at the bottom without contention, idle workers steal from the top; the core of Rayon, Tokio and Go.
›
Plugin delay compensation
media · medium: Align parallel audio paths by reported processing latency
Time stretching pitch shifting
media · medium: Phase vocoder and WSOLA time/pitch modification
Fft convolution
signal-processing · medium: Overlap-add and uniformly partitioned convolution for long FIR filters and reverb
Sample rate conversion
signal-processing · medium: Polyphase and windowed-sinc resampling; asynchronous rate conversion for clock drift
Incremental computation
systems · medium: Dependency graph of derived values recomputed only when inputs change (reactive cells, spreadsheets)
Memory ordering
concurrency · low: What Relaxed, Acquire, Release and SeqCst atomics actually guarantee, what they cost on x86 and ARM, and which one each pattern needs.
›
SPSC ring buffer
data-structures · low: Bounded wait-free queue for exactly one producer and one consumer thread, built from an array and two indices with acquire/release ordering.
›
Realtime audio callback
media · low: Allocation- and lock-free audio thread design with bounded work per buffer
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
IIR and FIR filters
signal-processing · low: Two ways to shape a sampled signal's spectrum: FIR (finite taps, always stable, exact linear phase) or IIR (feedback, a few coefficients, cheap but phase-distorting).
›
Shared memory ipc
concurrency · low: Shared memory rings and futex signalling between processes
Interval tree
data-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.
›
Undo redo
graphics · low: Command or snapshot history with grouping and coalescing
mmap and the page cache
hardware-os · low: How read() and mmap reach file data through the kernel page cache, what readahead and madvise do, and why databases use their own buffer pool instead.
›
Midi protocol
media · low: MIDI 1.0/2.0 messages, timing and sample-accurate event scheduling
Parameter smoothing
media · low: Per-sample ramps of control parameters to avoid zipper noise
Floating-point error
numerics · low: How IEEE 754 rounding error accumulates and how to contain it: compensated (Kahan/Neumaier) and pairwise summation, error-free transformations with FMA, ULP comparisons.
›
Epoch-based reclamation
concurrency · low: Threads announce a global epoch while touching shared lock-free data; garbage retired in epoch e is freed once the epoch reaches e + 2.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
Peak detection
signal-processing · low: Robust peak and event detection in noisy signals with adaptive thresholds and refractory periods
Short-time Fourier transform and sp…
signal-processing · low: Slide a window over a signal and FFT each frame to get a time-frequency picture; the front end of audio ML, vibration and radar analysis.
›
+ 9 more primitives
System
Techniques · 6
Primitives · 25
daw
Work-stealing deque
concurrency · medium: Per-worker deque: the owner pushes and pops at the bottom without contention, idle workers steal from the top; the core of Rayon, Tokio and Go.
›
Plugin delay compensation
media · medium: Align parallel audio paths by reported processing latency
Time stretching pitch shifting
media · medium: Phase vocoder and WSOLA time/pitch modification
Fft convolution
signal-processing · medium: Overlap-add and uniformly partitioned convolution for long FIR filters and reverb
Sample rate conversion
signal-processing · medium: Polyphase and windowed-sinc resampling; asynchronous rate conversion for clock drift
Incremental computation
systems · medium: Dependency graph of derived values recomputed only when inputs change (reactive cells, spreadsheets)
Memory ordering
concurrency · low: What Relaxed, Acquire, Release and SeqCst atomics actually guarantee, what they cost on x86 and ARM, and which one each pattern needs.
›
SPSC ring buffer
data-structures · low: Bounded wait-free queue for exactly one producer and one consumer thread, built from an array and two indices with acquire/release ordering.
›
Realtime audio callback
media · low: Allocation- and lock-free audio thread design with bounded work per buffer
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
IIR and FIR filters
signal-processing · low: Two ways to shape a sampled signal's spectrum: FIR (finite taps, always stable, exact linear phase) or IIR (feedback, a few coefficients, cheap but phase-distorting).
›
Shared memory ipc
concurrency · low: Shared memory rings and futex signalling between processes
Interval tree
data-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.
›
Undo redo
graphics · low: Command or snapshot history with grouping and coalescing
mmap and the page cache
hardware-os · low: How read() and mmap reach file data through the kernel page cache, what readahead and madvise do, and why databases use their own buffer pool instead.
›
Midi protocol
media · low: MIDI 1.0/2.0 messages, timing and sample-accurate event scheduling
Parameter smoothing
media · low: Per-sample ramps of control parameters to avoid zipper noise
Floating-point error
numerics · low: How IEEE 754 rounding error accumulates and how to contain it: compensated (Kahan/Neumaier) and pairwise summation, error-free transformations with FMA, ULP comparisons.
›
Epoch-based reclamation
concurrency · low: Threads announce a global epoch while touching shared lock-free data; garbage retired in epoch e is freed once the epoch reaches e + 2.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
Peak detection
signal-processing · low: Robust peak and event detection in noisy signals with adaptive thresholds and refractory periods
Short-time Fourier transform and sp…
signal-processing · low: Slide a window over a signal and FFT each frame to get a time-frequency picture; the front end of audio ML, vibration and radar analysis.
›
Fast Fourier transform
numerics · low: Computes the DFT in O(n log n) by recursively splitting into even and odd halves; the basis of fast convolution and spectral methods.
›
Hash consing
data-structures · low: Intern structurally equal immutable terms so equality is pointer comparison and sharing is maximal
Swiss table
data-structures · low: Open-addressing hash table that filters 8-16 slots at once with 1-byte hash tags and SIMD, giving fast lookups at 87.5 % load.
›
False sharing
concurrency · low: Independent variables written by different cores on one cache line force the line to bounce between cores; pad or regroup hot data to fix it.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
CPU caches and the memory hierarchy
hardware-os · low: Sizes, line widths and latencies of L1/L2/L3/DRAM on modern x86 and Apple M-series, and the data-layout rules that follow from them.
›
Virtual memory and the TLB
hardware-os · low: How page tables and TLBs translate every address, what TLB reach means, and when 2 MiB or 1 GiB huge pages pay off on Linux.
›
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
Biquad filters
signal-processing · low: Second-order IIR sections (RBJ cookbook): low/high pass, peaking EQ; stable cascades
Copy for AI
Similar systems
Share the most building blocks with this one.
game-audio-engine
24 %
realtime-audio-dsp
23 %
video-editor
21 %