Skip to content
HUIAHUB
VideointermediateModels & inference

How Inference Keeps Up with Our Insatiable Need for Tokens — Cerebras & Gimlet Labs

by AI Engineer22:46 long1.2K views

Why watchA 22-minute AI Engineer talk for inference engineers that covers runtime tricks like paged KV cache and chunked prefill, then system-level disaggregation and kernel-writing agents.

What this video covers

Recorded at the AI Engineer World's Fair 2026 in San Francisco, this talk runs about 22 minutes and is split between two speakers. Daniel Kim, Head of Growth at Cerebras, takes the inference runtime. Michelle, a co-founder of Gimlet Labs, takes the system level.

After a short intro, the 0:33 chapter is about demand: the description cites Google going from 480 trillion to 3.2 quadrillion tokens a month. At 2:02 Kim explains autoregressive decoding and why it is memory-bound. He covers splitting models across GPUs at 2:37 and then, at 3:27, the trade-off between speed and throughput drawn as a Pareto frontier. Batching and continuous batching come at 4:27.

The KV cache gets three chapters in a row: its memory growth (5:22), the paged KV cache (6:11) and prompt caching (7:06). Kim compares the prefill and decode phases at 7:41 and closes his half with chunked prefill for long contexts at 8:36.

Michelle starts at 9:38 with the point that workloads differ once you look at the whole system. Prefill-decode disaggregation follows at 11:06. At 12:21 the talk compares memory bandwidth on Cerebras hardware with the H100, and at 13:05 it discusses Cerebras together with AWS Trainium. Gimlet's multi-silicon inference cloud is the topic at 13:39. Speculative decoding starts at 14:28, and attention-FFN disaggregation at 17:01.

The final stretch is about agents. From 18:25 the talk covers agents that write optimized kernels, and the last chapter at 20:16 widens that to agents for silicon, compilers and ops.

Written by HuiaHub from the creator's title, description and chapters. All credit for the video goes to AI Engineer.

Key takeaways

  • Autoregressive decode is memory-bound, and the KV cache grows large as contexts lengthen.
  • Continuous batching trades per-user speed against total throughput along a Pareto frontier.
  • Paged KV cache, prompt caching and chunked prefill cut memory waste and repeated work.
  • Prefill/decode and attention/FFN disaggregation split model work into separately served parts.
  • Speculative decoding is one of the system-level methods covered for faster inference.
  • Agents can generate optimized kernels for different inference hardware.

Chapters

  1. 0:00Intro (opens YouTube at this moment)
  2. 0:33Exploding demand for tokens (opens YouTube at this moment)
  3. 2:02Autoregressive decoding and the memory bottleneck (opens YouTube at this moment)
  4. 2:37Splitting models across GPUs (opens YouTube at this moment)
  5. 3:27Speed vs throughput Pareto frontier (opens YouTube at this moment)
  6. 4:27Batching and continuous batching (opens YouTube at this moment)
  7. 5:22KV cache memory growth (opens YouTube at this moment)
  8. 6:11Paged KV cache (opens YouTube at this moment)
  9. 7:06Prompt caching (opens YouTube at this moment)
  10. 7:41Prefill vs decode (opens YouTube at this moment)
  11. 8:36Chunked prefill for long contexts (opens YouTube at this moment)
  12. 9:38System level: workloads differ (opens YouTube at this moment)
  13. 11:06Prefill-decode disaggregation (opens YouTube at this moment)
  14. 12:21Memory bandwidth: Cerebras vs H100 (opens YouTube at this moment)
  15. 13:05Cerebras and AWS Trainium (opens YouTube at this moment)
  16. 13:39Gimlet's multi-silicon inference cloud (opens YouTube at this moment)
  17. 14:28Speculative decoding (opens YouTube at this moment)
  18. 17:01Attention-FFN disaggregation (opens YouTube at this moment)
  19. 18:25Agents writing optimized kernels (opens YouTube at this moment)
  20. 20:16Agents for silicon, compilers and ops (opens YouTube at this moment)

More videos

All videos