Formal schedulability analysis for LLM inference: TTFT and TBT deadline guarantees via response-time theory
IntroductionLarge language model (LLM) inference systems operate under strict latency service-level objectives (SLOs): a deadline on the first output token (TTFT) and a maximum inter-token interval (TBT). Real-time (RT) scheduling theory provides formal schedulability tests, worst-case response-time...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Frontiers Media S.A.
2026-06-01
|
| Serier: | Frontiers in Computer Science |
| Fag: | |
| Online adgang: | https://www.frontiersin.org/articles/10.3389/fcomp.2026.1873627/full |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
