Fast LLM Serving with vLLM and PagedAttention

preview_player
Показать описание
LLMs promise to fundamentally change how we use AI across all industries. However, actually serving these models is challenging and can be surprisingly slow even on expensive hardware. To address this problem, we are developing vLLM, an open-source library for fast LLM inference and serving. vLLM utilizes PagedAttention, our new attention algorithm that effectively manages attention keys and values. vLLM equipped with PagedAttention achieves up to 24x higher throughput than HuggingFace Transformers, without requiring any model architecture changes. vLLM has been developed at UC Berkeley and deployed for Chatbot Arena and Vicuna Demo for the past three months. In this talk, we will discuss the motivation, features, and implementation of vLLM in depth, and present our future plan.

About Anyscale
---
Anyscale is the AI Application Platform for developing, running, and scaling AI.

If you're interested in a managed Ray service, check out:

About Ray
---
Ray is the most popular open source framework for scaling and productionizing AI workloads. From Generative AI and LLMs to computer vision, Ray powers the world’s most ambitious AI workloads.

#llm #machinelearning #ray #deeplearning #distributedsystems #python #genai
Рекомендации по теме
Комментарии
Автор

Beautiful adaptation of a fundamental idea of paging, reference counting and copy -on-write.👌

hemanthsethuram
Автор

Full circle dynamic memory management and garbage collection. Great talk!

dinoscheidt
Автор

Such an elegant idea and amazingly clear explanation!

simonguo
Автор

It seems like there would be a performance increase for beam search as well? (That is, in addition to the memory savings it gets.) Would be great to see some benchmarks for that!

mshonle
Автор

Interesting sharings. Curious about the underlying implementation for KV blocks sharing part you have a copy-on-write mechanism, but how does it avoid dirty-read condition, where both request reads that ref count is 2 and both request copies the block simultaneously.

vaporeon
Автор

I think the last question was asked on impact on latency

alankhor
Автор

How do we calculate memory used by kv cache in paged attention.Example for input 500 and output 1000

Karthikprath