mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Hardware and datacenter
datacenter-facility
datacenter power and cooling
hyperscale datacenters
System
Techniques · 21
Primitives · 46
datacenter-facility
Datacenter cooling
cloud · medium: Hot/cold aisle containment, free cooling, direct liquid cooling and PUE math
Power oversubscription capping
cloud · medium: Oversubscribe datacenter power with telemetry and fast capping (RAPL, priority-based throttling)
Ups power distribution
cloud · medium: UPS, PDUs, busways and redundancy schemes (N+1, 2N) for datacenter power
Finite volume method
numerics · medium: Conservative cell-averaged discretization with numerical fluxes on structured and unstructured meshes
Vector bin packing
optimization · medium: Multi-dimensional bin packing heuristics (first fit decreasing, dot product) for placing VMs and jobs
Model predictive control
robotics · medium: Each tick, solve a small optimization over a predicted horizon, apply only the first input, repeat. Handles constraints and multiple inputs that a PID loop cannot.
›
Time-series anomaly detection
statistics · medium: Predict the expected value from a seasonal baseline, scale the residual by a robust spread (MAD), threshold at a chosen false-alarm rate, then merge flags into incidents.
›
PID controller
robotics · low: Drive a measured value to a setpoint with three terms on the error: proportional, integral, derivative. The default feedback loop for motors, heaters, drones and gimbals.
›
Power management dvfs
hardware-os · low: DVFS governors, P- and C-states, race-to-idle, thermal throttling
Gorilla XOR compression
compression · low: Time-series codec: delta-of-delta timestamps plus XOR of consecutive float bit patterns, storing only changed bits; about 1.4 bytes per point.
›
Bacnet protocol
embedded · low: BACnet objects, properties and services over IP/MSTP for building automation
Modbus protocol
embedded · low: Modbus RTU/TCP registers and function codes with polling and CRC
Fixed-rate control loop
embedded · low: Run a controller at an exact period using absolute deadlines and a fixed dt, so jitter never accumulates and the math stays valid.
›
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.
›
Unstructured mesh representation
numerics · low: Cell-face-node connectivity in CSR form for FEM and FVM meshes; partition-friendly ordering
Bin packing
optimization · low: Pack items of given sizes into the fewest fixed-capacity bins; sort descending, then first-fit, gives at most 11/9 of optimal and runs in O(n log n).
›
Runge-Kutta 4
numerics · low: The classic four-stage, fourth-order ODE step; error drops 16× when the step halves, with no derivatives or past steps needed.
›
Kalman filter
robotics · low: Optimal recursive estimator for a linear system with Gaussian noise: fuses a motion model with noisy measurements into a state estimate plus its covariance.
›
Isolation forest
machine-learning · low: Score each record by how few random axis-aligned splits it takes to isolate it in a small forest of random trees; anomalies are few and different, so they isolate fast.
›
Exponential smoothing (ETS, Holt-Wi…
statistics · low: Forecast by keeping a few running states (level, trend, seasonal) updated by a fraction of each forecast error; O(1) memory per series and a strong baseline.
›
Robust statistics
statistics · low: Location and scale estimates (median, MAD, trimmed mean, Huber M-estimator) that stay correct when a minority of the data is garbage.
›
STL decomposition (seasonal-trend w…
statistics · low: Split a series into trend, seasonal and remainder with iterated loess smoothing; the seasonal shape may drift and robust weights keep outliers out of it.
›
Debouncing throttling
systems · low: Coalescing rapid events: debounce (wait for quiet), throttle (max rate), and cancelling stale in-flight requests
+ 14 more techniques
+ 30 more primitives
System
Techniques · 21
Primitives · 46
datacenter-facility
Datacenter cooling
cloud · medium: Hot/cold aisle containment, free cooling, direct liquid cooling and PUE math
Power oversubscription capping
cloud · medium: Oversubscribe datacenter power with telemetry and fast capping (RAPL, priority-based throttling)
Ups power distribution
cloud · medium: UPS, PDUs, busways and redundancy schemes (N+1, 2N) for datacenter power
Finite volume method
numerics · medium: Conservative cell-averaged discretization with numerical fluxes on structured and unstructured meshes
Vector bin packing
optimization · medium: Multi-dimensional bin packing heuristics (first fit decreasing, dot product) for placing VMs and jobs
Model predictive control
robotics · medium: Each tick, solve a small optimization over a predicted horizon, apply only the first input, repeat. Handles constraints and multiple inputs that a PID loop cannot.
›
Time-series anomaly detection
statistics · medium: Predict the expected value from a seasonal baseline, scale the residual by a robust spread (MAD), threshold at a chosen false-alarm rate, then merge flags into incidents.
›
Alarm management
embedded · medium: Turn raw process limits into a few actionable operator alarms with delay, deadband, acknowledge and shelving states, plus flood measurement.
›
Battery state estimation
embedded · medium: State of charge / health / power from coulomb counting, OCV curves and model-based observers
Hot-standby redundancy
embedded · medium: A second, always-current controller shadows the primary and takes over within a few cycles of silence; epochs stop the old primary from fighting back.
›
Flux limiters upwinding
numerics · medium: Upwind schemes, TVD flux limiters, MUSCL and Riemann solvers for shock-capturing advection
Column generation
optimization · medium: Solve a huge LP by keeping only a few columns and pricing new ones from a subproblem until none can improve; gives the Dantzig-Wolfe bound.
›
Quadratic programming
optimization · medium: Convex QP solvers (active-set, interior-point, ADMM) for constrained optimization
Priority and preemption
systems · medium: Priority classes, quota and evicting lower-priority work to admit higher
Primary-backup replication
distributed · medium: One node orders all writes and ships them to standbys; the acknowledgement rule (none, one, all) sets what a crash loses, and an external arbiter decides who takes over.
›
Equivalent circuit battery model
embedded · medium: Thevenin RC-network battery models with OCV-SoC curves and parameter identification
Interior-point method (primal-dual,…
optimization · medium: Follows the central path with Newton steps on the perturbed KKT system, one sparse Cholesky per iteration; Mehrotra's predictor-corrector makes it fast.
›
Levenberg marquardt
numerics · medium: Damped Gauss-Newton nonlinear least squares for model calibration
Sparse direct solver
numerics · medium: Solve sparse Ax = b exactly by reordering, symbolic analysis, numeric LLᵀ/LU and triangular solves; fill-in, not flops per entry, decides the cost.
›
Fill-reducing ordering
numerics · medium: Permute a sparse symmetric matrix before Cholesky/LU so the factor has few new nonzeros; minimum degree, nested dissection and RCM trade quality, speed and parallelism.
›
Graph partitioning
graphs · medium: Split a graph into k balanced parts with few edges between them; multilevel coarsen-partition-refine (METIS, KaHIP) for quality, streaming heuristics (LDG, Fennel) for one-pass scale.
›
PID controller
robotics · low: Drive a measured value to a setpoint with three terms on the error: proportional, integral, derivative. The default feedback loop for motors, heaters, drones and gimbals.
›
Power management dvfs
hardware-os · low: DVFS governors, P- and C-states, race-to-idle, thermal throttling
Gorilla XOR compression
compression · low: Time-series codec: delta-of-delta timestamps plus XOR of consecutive float bit patterns, storing only changed bits; about 1.4 bytes per point.
›
Bacnet protocol
embedded · low: BACnet objects, properties and services over IP/MSTP for building automation
Modbus protocol
embedded · low: Modbus RTU/TCP registers and function codes with polling and CRC
Fixed-rate control loop
embedded · low: Run a controller at an exact period using absolute deadlines and a fixed dt, so jitter never accumulates and the math stays valid.
›
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.
›
Unstructured mesh representation
numerics · low: Cell-face-node connectivity in CSR form for FEM and FVM meshes; partition-friendly ordering
Bin packing
optimization · low: Pack items of given sizes into the fewest fixed-capacity bins; sort descending, then first-fit, gives at most 11/9 of optimal and runs in O(n log n).
›
Runge-Kutta 4
numerics · low: The classic four-stage, fourth-order ODE step; error drops 16× when the step halves, with no derivatives or past steps needed.
›
Kalman filter
robotics · low: Optimal recursive estimator for a linear system with Gaussian noise: fuses a motion model with noisy measurements into a state estimate plus its covariance.
›
Isolation forest
machine-learning · low: Score each record by how few random axis-aligned splits it takes to isolate it in a small forest of random trees; anomalies are few and different, so they isolate fast.
›
Exponential smoothing (ETS, Holt-Wi…
statistics · low: Forecast by keeping a few running states (level, trend, seasonal) updated by a fraction of each forecast error; O(1) memory per series and a strong baseline.
›
Robust statistics
statistics · low: Location and scale estimates (median, MAD, trimmed mean, Huber M-estimator) that stay correct when a minority of the data is garbage.
›
STL decomposition (seasonal-trend w…
statistics · low: Split a series into trend, seasonal and remainder with iterated loess smoothing; the seasonal shape may drift and robust weights keep outliers out of it.
›
Debouncing throttling
systems · low: Coalescing rapid events: debounce (wait for quiet), throttle (max rate), and cancelling stale in-flight requests
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Extended Kalman filter
robotics · low: Kalman filter for nonlinear motion and measurement models: linearize f and h with Jacobians at the current estimate each step. The default estimator in robot navigation.
›
Watchdog timer
embedded · low: A hardware down-counter that resets the chip unless software proves, in time and in a plausible pattern, that it is still healthy.
›
Finite differences
numerics · low: Replace derivatives with weighted differences of grid values; simple stencils plus a stability condition (CFL) turn PDEs like heat, advection and waves into array loops.
›
Dijkstra's algorithm
graphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.
›
Simplex method
optimization · low: Solves linear programs by walking along the edges of the feasible polytope from vertex to vertex, one basis swap (pivot) at a time; the workhorse behind MIP solvers.
›
Subset sum dp
optimization · low: Subset-sum / knapsack DP for matching one amount to a combination of many
LU and Cholesky factorization
numerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).
›
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.
›
Resource usage accounting
hardware-os · low: Cgroup/procfs/GPU counters sampled into per-workload usage
Graceful draining
systems · low: On a termination signal, stop taking new work, finish in-flight work until a deadline, tell clients to reconnect elsewhere, then exit; clients resume from a token.
›
Leases
distributed · low: A lock that expires on its own: bounded-time ownership that survives crashes and partitions, given bounded clock drift and fencing tokens on writes.
›
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.
›
Health checking
systems · low: Decide per backend whether to route to it using probes and real-traffic errors, with consecutive-count hysteresis, capped ejection and a panic fallback.
›
Explicit Euler
numerics · low: Step an ODE forward by its current slope, y += h·f(t, y); first-order, one evaluation per step, the baseline every other integrator is measured against.
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Bit packing and PFOR
compression · low: Store blocks of integers with exactly b bits each and patch rare outliers separately (PFOR); the fastest integer codec family, billions of values per second.
›
Delta encoding
compression · low: Store differences between consecutive values instead of the values, turning sorted IDs, timestamps and counters into small numbers that pack into few bits.
›
Varint (LEB128)
compression · low: Variable-length integers in 7-bit groups with a continuation bit; small numbers take 1 byte, the wire format of Protobuf, WebAssembly and DWARF.
›
Fencing tokens
distributed · low: A number that grows with every lock grant and is checked by the protected resource, so a paused ex-holder's late write is rejected.
›
Dma transfers
embedded · low: DMA controllers: descriptors, circular buffers, cache coherence for zero-CPU data movement
PWM generation
embedded · low: A timer's counter, period and compare registers draw the pulse train; preload, dead time and DMA make duty changes glitch-free, shoot-through-free and cheap.
›
Bitstream serialization
game-networking · low: A bit writer and reader over a byte buffer that stores each field in exactly the bits its range needs: booleans in 1 bit, bounded integers in ceil(log2(span+1)) bits.
›
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.
›
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.
›
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.
›
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.
›
Thomas tridiagonal solver
numerics · low: O(n) tridiagonal linear solve used in implicit finite-difference and spline schemes
Copy for AI
Similar systems
Share the most building blocks with this one.
gigawatt-ai-campus
45 %
rack-scale-system
21 %
dc-power-ups
20 %
digital-twin
20 %