Web Analytics Made Easy - Statcounter

Blog

From Requests to Sessions: Workload characterization of Agentic Workloads

event person William Nixon

Our takeaways from analyzing coding-agent traffic from FreeInference.

Read more →

Stop Waiting for Weights: Efficient RL Updates with WeightBridge

event person Xuanlin Jiang

WeightBridge automatically bridges trainer and rollout layouts and reduces GPU stall time during RL weight updates by up to 42×.

Read more →

A Year in LLM Serving: Workloads, Caching, and Routing

event person William Nixon

An analysis of 6.12 billion production LLM requests, examining workload evolution, traffic patterns, prefix reuse, cache eviction, and request routing.

Read more →

Learning-Augmented Heuristics: A Different Way to Build Smart Caches

event person William Nixon

Smart cache eviction algorithms can adapt to workloads, but they often pay for it with complexity, instability, or overhead. Learning-Augmented Heuristics takes a different approach: keep the fast heuristic on the data path, and use learning to configure it at a slower timescale.

Read more →

When Bursty Traffic Makes LLM Inference Faster

event person Akira van de Groenendaal

Bursty arrivals usually cause a drop in performance and are seen as headaches in production systems. In this blog, we investigate a phenomenon where burstiness actually improves performance, uncovering what conditions produce this effect.

Read more →

Why FIFO Is (Almost) All You Need for Cache Eviction

event person Juncheng Yang

Cache eviction is usually presented as a ranking problem. LRU ranks objects by recency. LFU ranks them by frequency. More advanced algorithms combine several signals, adapt their parameters, and maintain increasingly sophisticated data structures to decide which object is least valuable.

Read more →

MorphServe: Making Model Precision Elastic for Bursty LLM Serving

event person Juncheng Yang

Most LLM servers treat a deployed model as fixed: its weights have one precision, its KV cache has one memory budget, and both remain unchanged until the process restarts.

Read more →

Pelikan Segcache: a memory-efficient and scalable in-memory key-value cache for small objects

event person Juncheng Yang

In collaboration with Carnegie Mellon University, Twitter is building Pelikan’s next generation of storage backend, which enables high memory efficiency, high throughput, and scalability for workloads that are primarily small objects and widely use TTL (time-to-live).

Read more →