mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Hardware and datacenter
ssd-controller
SSD controller and flash translation layer
NVMe SSDs
System
Techniques · 8
Primitives · 21
ssd-controller
Ldpc codes
signal-processing · medium: Low-density parity-check codes with soft-decision min-sum decoding, used in NAND flash
Crash consistency ordering
storage · medium: Ordered writes, barriers and FUA so on-disk state is valid after power loss at any point
Erasure coding
storage · medium: Reed-Solomon k+m coding to survive m lost shards at lower overhead than replication
Flash garbage collection
storage · medium: Victim block selection (greedy, cost-benefit), valid page migration and write amplification in SSDs
Flash translation layer
storage · medium: Logical-to-physical page mapping in SSDs: page or hybrid mapping, DFTL caching, out-of-place writes
Wear leveling
storage · medium: Spread erases across flash blocks: dynamic and static wear leveling, read disturb refresh
Zoned storage
storage · medium: Zoned namespaces and SMR: sequential write zones, zone append, host-managed garbage collection
LRU and CLOCK
systems · low: LRU evicts the least recently used entry via hash map plus linked list; CLOCK approximates it with a reference bit, so hits take no lock.
›
Nvme queues
hardware-os · low: NVMe submission and completion queue pairs, doorbells and polling from a driver
SSD and NVMe internals
hardware-os · low: NAND pages and erase blocks, the FTL, garbage collection and write amplification, NVMe queues and queue depth, and 4 KiB alignment, with the numbers that matter.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
Dram organization
hardware-os · low: Channels, ranks, banks, rows; row-buffer hits, refresh, timing parameters; DDR5 and HBM
AEAD (AES-GCM, ChaCha20-Poly1305)
security · low: Authenticated encryption that encrypts and detects tampering in one call; the only kind of symmetric encryption you should use.
›
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.
›
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.
›
Qam soft demapping
signal-processing · low: PSK/QAM constellation mapping and max-log LLR soft demapping for decoders
Atomic file replacement
hardware-os · low: Write temp file, fsync, rename over target, fsync directory: crash-safe whole-file updates
fsync, O_DSYNC and O_DIRECT
hardware-os · low: What fsync, fdatasync, O_DSYNC, O_DIRECT and F_FULLFSYNC really guarantee on Linux and macOS, and the exact call sequences for crash-safe files.
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Finite field arithmetic
numerics · low: Prime-field and extension-field arithmetic (Montgomery form, Goldilocks, BabyBear), vectorized
Reed-Solomon codes
signal-processing · low: Byte-oriented MDS code: n-k parity symbols correct (n-k)/2 unknown symbol errors or n-k known erasures; the workhorse for bursts, QR codes, discs and storage.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Free space management
storage · low: Free-space bitmaps, extent B-trees and space maps; allocation policies and fragmentation
+ 1 more techniques
+ 5 more primitives
System
Techniques · 8
Primitives · 21
ssd-controller
Ldpc codes
signal-processing · medium: Low-density parity-check codes with soft-decision min-sum decoding, used in NAND flash
Crash consistency ordering
storage · medium: Ordered writes, barriers and FUA so on-disk state is valid after power loss at any point
Erasure coding
storage · medium: Reed-Solomon k+m coding to survive m lost shards at lower overhead than replication
Flash garbage collection
storage · medium: Victim block selection (greedy, cost-benefit), valid page migration and write amplification in SSDs
Flash translation layer
storage · medium: Logical-to-physical page mapping in SSDs: page or hybrid mapping, DFTL caching, out-of-place writes
Wear leveling
storage · medium: Spread erases across flash blocks: dynamic and static wear leveling, read disturb refresh
Zoned storage
storage · medium: Zoned namespaces and SMR: sequential write zones, zone append, host-managed garbage collection
Log-structured storage
storage · medium: Make the log the store: append every write, point an index at the newest copy, reclaim space by copying live records forward.
›
LRU and CLOCK
systems · low: LRU evicts the least recently used entry via hash map plus linked list; CLOCK approximates it with a reference bit, so hits take no lock.
›
Nvme queues
hardware-os · low: NVMe submission and completion queue pairs, doorbells and polling from a driver
SSD and NVMe internals
hardware-os · low: NAND pages and erase blocks, the FTL, garbage collection and write amplification, NVMe queues and queue depth, and 4 KiB alignment, with the numbers that matter.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
Dram organization
hardware-os · low: Channels, ranks, banks, rows; row-buffer hits, refresh, timing parameters; DDR5 and HBM
AEAD (AES-GCM, ChaCha20-Poly1305)
security · low: Authenticated encryption that encrypts and detects tampering in one call; the only kind of symmetric encryption you should use.
›
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.
›
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.
›
Qam soft demapping
signal-processing · low: PSK/QAM constellation mapping and max-log LLR soft demapping for decoders
Atomic file replacement
hardware-os · low: Write temp file, fsync, rename over target, fsync directory: crash-safe whole-file updates
fsync, O_DSYNC and O_DIRECT
hardware-os · low: What fsync, fdatasync, O_DSYNC, O_DIRECT and F_FULLFSYNC really guarantee on Linux and macOS, and the exact call sequences for crash-safe files.
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Finite field arithmetic
numerics · low: Prime-field and extension-field arithmetic (Montgomery form, Goldilocks, BabyBear), vectorized
Reed-Solomon codes
signal-processing · low: Byte-oriented MDS code: n-k parity symbols correct (n-k)/2 unknown symbol errors or n-k known erasures; the workhorse for bursts, QR codes, discs and storage.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Free space management
storage · low: Free-space bitmaps, extent B-trees and space maps; allocation policies and fragmentation
Edac memory scrubbing
embedded · low: ECC/EDAC memory with periodic scrubbing to correct radiation-induced bit flips
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.
›
Segmented log
distributed · low: Split an append-only log into files named by their first offset, write only the newest, and find any record by binary search plus a sparse index.
›
Constant time code
security · low: Writing secret-dependent code without branches or memory lookups on secrets; constant-time compare and select
Csprng
security · low: OS-backed cryptographically secure random numbers (getrandom), and when a fast PRNG is not enough
Copy for AI
Similar systems
Share the most building blocks with this one.
filesystem
15 %