mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Hardware and datacenter
switch-asic
programmable network switch
Tofino, P4
System
Techniques · 4
Primitives · 21
switch-asic
Active queue management
networking · medium: RED, CoDel and PIE: drop or ECN-mark early to keep switch and router queues short
Datacenter congestion control
networking · medium: ECN-based schemes for RDMA and DC TCP: DCQCN, DCTCP, HPCC, plus PFC lossless pitfalls
In network aggregation
networking · medium: Reduce gradients or data inside switches (SHARP, SwitchML) to cut allreduce traffic
Match action pipelines
networking · medium: RMT switch pipelines: parsed headers flow through match-action stages; P4 programming model
Fair queuing
networking · low: Deficit round robin / weighted fair queuing to share capacity among tenants or flows
Packet header parsing
networking · low: Parse graph state machines for Ethernet, IP, TCP and UDP headers in hardware and software
Longest prefix match
networking · low: IP prefix lookup structures (DIR-24-8, Poptrie, LC-trie) for routes, ACLs and geo-IP
Tcam ternary matching
networking · low: TCAM ternary match tables: priorities, range expansion, power and capacity trade-offs
Bloom filter
data-structures · low: Bit array answering "definitely not present" or "probably present" in about 10 bits per key for 1 % false positives; inserts are cheap, deletes impossible.
›
Count-min sketch
data-structures · low: d rows of w counters estimate any item's frequency in a stream, overestimating by at most ε·N with probability 1-δ, in fixed tiny memory.
›
Cuckoo hashing
data-structures · low: Every key lives in one of two candidate buckets, so lookups read at most two cache lines; inserts evict residents to their alternate bucket.
›
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.
›
Ecmp
networking · low: Equal-cost multipath: hash flows across next hops; resilient hashing on changes
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
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.
›
Active path probing
networking · low: Continuous loss/latency/jitter probes per WAN path to drive path selection
Credit based flow control
networking · low: Receiver-granted credits/windows bound in-flight data (HTTP/2 windows, AMQP prefetch, backpressure)
Rdma
networking · low: RDMA verbs over InfiniBand/RoCE: queue pairs, memory registration, one-sided ops
Deterministic fixed-point math
game-networking · low: Bit-identical simulation math across CPUs, compilers and builds: integer fixed-point formats, the float traps (FMA, x87, fast-math, libm), deterministic trig, sqrt and RNG.
›
Collective communication
ml-training · low: The family of group exchanges (broadcast, reduce, all-gather, reduce-scatter, all-to-all) and the latency-plus-bytes cost model that picks ring, tree or direct algorithms by message size and topology.
›
+ 5 more primitives
System
Techniques · 4
Primitives · 21
switch-asic
Active queue management
networking · medium: RED, CoDel and PIE: drop or ECN-mark early to keep switch and router queues short
Datacenter congestion control
networking · medium: ECN-based schemes for RDMA and DC TCP: DCQCN, DCTCP, HPCC, plus PFC lossless pitfalls
In network aggregation
networking · medium: Reduce gradients or data inside switches (SHARP, SwitchML) to cut allreduce traffic
Match action pipelines
networking · medium: RMT switch pipelines: parsed headers flow through match-action stages; P4 programming model
Fair queuing
networking · low: Deficit round robin / weighted fair queuing to share capacity among tenants or flows
Packet header parsing
networking · low: Parse graph state machines for Ethernet, IP, TCP and UDP headers in hardware and software
Longest prefix match
networking · low: IP prefix lookup structures (DIR-24-8, Poptrie, LC-trie) for routes, ACLs and geo-IP
Tcam ternary matching
networking · low: TCAM ternary match tables: priorities, range expansion, power and capacity trade-offs
Bloom filter
data-structures · low: Bit array answering "definitely not present" or "probably present" in about 10 bits per key for 1 % false positives; inserts are cheap, deletes impossible.
›
Count-min sketch
data-structures · low: d rows of w counters estimate any item's frequency in a stream, overestimating by at most ε·N with probability 1-δ, in fixed tiny memory.
›
Cuckoo hashing
data-structures · low: Every key lives in one of two candidate buckets, so lookups read at most two cache lines; inserts evict residents to their alternate bucket.
›
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.
›
Ecmp
networking · low: Equal-cost multipath: hash flows across next hops; resilient hashing on changes
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
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.
›
Active path probing
networking · low: Continuous loss/latency/jitter probes per WAN path to drive path selection
Credit based flow control
networking · low: Receiver-granted credits/windows bound in-flight data (HTTP/2 windows, AMQP prefetch, backpressure)
Rdma
networking · low: RDMA verbs over InfiniBand/RoCE: queue pairs, memory registration, one-sided ops
Deterministic fixed-point math
game-networking · low: Bit-identical simulation math across CPUs, compilers and builds: integer fixed-point formats, the float traps (FMA, x87, fast-math, libm), deterministic trig, sqrt and RNG.
›
Collective communication
ml-training · low: The family of group exchanges (broadcast, reduce, all-gather, reduce-scatter, all-to-all) and the latency-plus-bytes cost model that picks ring, tree or direct algorithms by message size and topology.
›
Selective repeat arq
networking · low: Selective-repeat ARQ with windows, status reports and in-order reassembly
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.
›
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.
›
Fast hash functions
data-structures · low: Non-cryptographic hashes built from 64×64→128-bit multiplies and xor-shifts; pick by key size, trust level and whether the hash is persisted.
›
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.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
ip-backbone
20 %