arXiv: cs.AI preprintsInternational11 November 2026
Placing LLM Lookup Tables by Per-Layer Prefetch Deadlines
This is an official announcement record
Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2611.13413v1 Announce Type: cross Abstract: DeepSeek-V4.1's 203 GB of Engram n-gram tables sit in host DRAM today, taking 190 of the 223 GiB a 4-GPU serving process uses. Row indices depend only on input tokens, so reads can start with each step and overlap earlier layers. V4.1's two Engram layers have windows that differ by 30x (0.3 vs. 9.3 ms). We show that this deadline, together with session reuse and contention on a shared device, decides which tier each table can use and which layers need cache, and we give a model that predicts the resulting slowdown from measured read times. Agen
Read the official announcement
Opens arxiv.org
More from arXiv: cs.AI preprints
- Auditable Human-Agent Teams for Autonomous X-ray Experimentation11 November 2026
- EarthRecord: From Pixels to Land Change with Multimodal Agents over Four Decades of Satellite Imagery11 November 2026
- Train on prefill, monitor at decode: Using sparse autoencoders for topic monitoring11 November 2026
- LandslideFM: A Foundation Model Towards Unified Landslide Perception and Understanding11 November 2026
- Tracing Psychometric Inference in Large Language Models11 November 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.