littles-law-reasoning

Analyzes Little's Law-based models to explain latency, throughput, concurrency, and utilization in software systems.

2|Updated Apr 30, 2026
One-click install
npx skills add https://github.com/NlightNFotis/skills --skill littles-law-reasoning
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: littles-law-reasoning
Source: https://github.com/NlightNFotis/skills/tree/main/littles-law-reasoning
Command: npx skills add https://github.com/NlightNFotis/skills --skill littles-law-reasoning

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

This Skill helps you reason about latency, throughput, queue depth, and utilization with a concrete queueing model instead of intuition alone. It is useful when systems slow down under load, tail latency spikes, or scaling decisions around workers, threads, and pools are being made without a clear explanation of what will actually improve performance.

Core Features & Use Cases

  • Little's Law analysis: Relates in-flight work, arrival rate, and time in system so you can derive the missing quantity from measurements you already have.
  • Utilization and bottleneck diagnosis: Identifies whether latency is driven by high utilization, service-time variance, bounded queues, or the wrong bottleneck being optimized.
  • Capacity planning and pool sizing: Supports thread pool sizing, connection limits, autoscaling reviews, timeout decisions, and deciding whether to add concurrency or reduce service time.
  • Use case: When an API's p99 latency suddenly worsens after traffic grows, use this Skill to compute the operating point, locate the system on the utilization curve, and determine whether the right action is adding workers, reducing service time, splitting workloads, or fixing a downstream bottleneck.

Quick Start

Ask the littles-law-reasoning skill to analyze your service using current request rate, average latency, in-flight count, worker count, and estimated service time.

Frequently Asked Questions about littles-law-reasoning

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How does Little's Law explain latency spikes when traffic grows?

How do I size thread pools and connection limits for capacity planning?

Why does p99 latency worsen under load and how do I find the bottleneck?

To size thread pools and connection limits, analyze your service demand and current arrival rate against worker count. This capacity planning approach determines whether adding concurrency or reducing service time will effectively lower utilization and improve throughput.

What measurements do I need to calculate throughput and utilization?

P99 latency worsens under load due to high utilization, service-time variance, or bounded queues. Find the bottleneck by computing your operating point on the utilization curve to see if the latency is driven by the wrong resource being optimized.

When should I add workers versus reducing service time to fix tail latency?

To calculate throughput and utilization, you need explicit system boundaries along with measured or inferred values for arrival rate, residence time, in-flight work count, and estimated service time to compare against service demand.

Does Little's Law work for autoscaling review and open versus closed workload analysis?

Add workers when latency is driven by high utilization and bounded concurrency. Reduce service time when tail latency is caused by service-time variance or a downstream bottleneck, applying variability-aware queueing analysis.

Does Little's Law work for autoscaling review and open versus closed workload analysis?

Little's Law works for autoscaling review and open versus closed workload analysis by modeling queueing behavior. It evaluates whether autoscaling decisions will actually improve performance or simply mask a downstream bottleneck.