Tag
throughput
- Jun 18, 2026 Iteration-Level Batching and the Cost of a Fixed Batch Why a batch fixed at admission time strands accelerator capacity, and how re-deciding the batch at every decode step changes the cost of a token. inference systems
- Jun 10, 2026 Costing a Parallel Plan: Workers, Gather, and the Serial Fraction Why dividing a plan cost by the number of workers overestimates the gain, how the planner prices worker startup and row transfer, and when a parallel plan loses to a serial one. databases
- May 11, 2026 The Effective Window: Congestion Window, Receive Window, and Buffers Why three independent limits govern how much a TCP sender may have outstanding, how the congestion window grows and collapses, and which limit binds in practice. networking
- May 1, 2026 Batching and the Amortization of Per-Item Cost How grouping work converts a fixed per-operation cost into a per-batch cost, where the delay comes from, and why batch size is a throughput constraint rather than a tuning knob. performance engineering
- Apr 2, 2026 Amdahl and Gustafson Bounds in Capacity Models Why a serial fraction caps the throughput a fixed workload can reach, how scaled workload changes the bound, and what the usable-scalability limit means for sizing a fleet. performance engineering
- Mar 31, 2026 Forecasting Completion Dates from Historical Throughput Resampling the observed rate of finished work to produce a distribution of completion dates, and the assumptions about scope, unit, and independence that decide whether the answer means anything. software engineering
- Dec 31, 2025 Airtime Fairness and Why One Slow Client Halves a Cell How per-station throughput diverges from per-station airtime, how frame duration is computed from rate and size, and what a scheduler can do about it. networking
- Nov 21, 2025 Batching and the Amortization of Per-Request Cost How grouping work into larger units trades latency for throughput, which fixed costs actually amortize, and where a batch becomes slower than the sum of its parts. backend systems
- Nov 1, 2025 Averaging Ratios and the Geometric Mean in Composite Scores Why the arithmetic mean of normalised ratios depends on the reference machine, when the geometric mean is the right summary, and where the harmonic mean is forced by the arithmetic of rates. performance engineering
- Oct 4, 2025 A-MPDU Aggregation and Block Acknowledgement How 802.11n packs many frames into one transmission, why each subframe keeps its own check sequence, and what the block ack bitmap window buys. networking
- Jun 12, 2025 Speculative Decoding Cost Accounting: The Acceptance Rate Threshold How draft tokens turn a bandwidth-bound decode step into several tokens, the acceptance rate at which the extra compute pays for itself, and why batch size moves that threshold. inference systems
- Feb 24, 2025 Decode Bandwidth and the Cost of Variable Instruction Length Why fixed-width instructions let a front end decode several per cycle, how variable-length encodings force serial scanning, and where the two approaches land on fetch and decode throughput. computer architecture
- Dec 25, 2024 Throughput, Latency, and Why Concurrency Is Not Parallelism How the relation between completion rate, response time, and in-flight work constrains every scaling decision, and why overlapping waits and splitting computation buy throughput in different ways. performance engineering
- Aug 16, 2024 Cycle Time, Work-in-Progress Limits, and Little's Law in Delivery Queues How the identity L = lambda W ties items in flight to delivery time, why operating near full capacity inflates waiting, and how to size a work-in-progress limit from a target cycle time. software engineering
- Jun 18, 2024 Request Rate Limits and Why Key Prefixes Are Partitioned A bucket scales by splitting its keyspace across index partitions. Sequential keys hammer one partition, so the naming scheme decides the achievable request rate. cloud infrastructure
- Apr 2, 2024 The Universal Scalability Law: Why Throughput Peaks and Then Falls How contention and coherency terms extend Amdahl's bound into a curve that predicts a maximum, what retrograde scaling looks like, and how to fit the two parameters from measurements. performance engineering
- Jun 6, 2023 The Five-Stage Pipeline and the Throughput It Buys Why splitting a datapath into five stages raises instruction throughput without shortening any single instruction, and what latch overhead and stage imbalance take back. computer architecture
- May 24, 2022 Job Classes, Initiators, and How a Batch Queue Gets Ordered Why a batch scheduler separates jobs into classes consumed by independent initiators, what an initiator costs in storage, and how starvation and throughput pull against each other. computing history