Live data from Hacker News

vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

vllm.ai

21–30 of 43 posts

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#21
post #14

Earlier quoted context omitted.

this approach to managing KV cache can work with 4bit. imagine the speedup of pagedattention with quantization..

yep, it is agonistic to 4-bit. You can deploy a 4-bit model and still use vllm + pagedattention to double or even triple your serving throughput.

If this were submitted as a new comment it would be at the top of the page.

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#23
post #9

Does this mean that GPT-4/65b level performance is closer to running on a say a m1/m2 with only 24+ gigabytes of ram?

Nope. You will still need a proper GPU. You can't yet run large language models on tiny hardware like an m1/m2. Even the llama.cpp magic is only possible with very small models at beam size 1, which really limits the "creativity" of these models.

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#24
I wonder how this compares to Flash Attention (https://github.com/HazyResearch/flash-attention), which is the other "memory aware" Attention project I'm aware of.

I guess Flash Attention is more about utilizing memory GPU SRam correctly, where this is more about using the OS/CPU memory better?

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#25

I wonder how this compares to Flash Attention ( https://github.com/HazyResearch/flash-attention ), which is the other "memory aware" Attention project I'm aware of. I guess Flash Attention is more about utilizing memory GPU SRam correctly, where this is more about using the OS/CPU memory better?

The ideas are orthogonal, and can be used (theoretically) at the same time.

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#27
post #15

Now do the same for image classifiers. I tried a few of them, they're just horribly slow. This is pretty outrageous considering the first robust image image classifiers appeared around 2007.

Doesn't work on image classifiers, because there's no KV cache. Also, standard image classifiers can do 100-1000 images/sec without any optimizations.

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#28

I wonder how this compares to Flash Attention ( https://github.com/HazyResearch/flash-attention ), which is the other "memory aware" Attention project I'm aware of. I guess Flash Attention is more about utilizing memory GPU SRam correctly, where this is more about using the OS/CPU memory better?

I think they are orthogonal.

Flash attention is just another way to compute exact attention.

This work mainly concerns how to resolve memory fragmentation across different sequences

You still need to compute attention as is once you retrieve the needed key values

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#29
post #14

Earlier quoted context omitted.

this approach to managing KV cache can work with 4bit. imagine the speedup of pagedattention with quantization..

yep, it is agonistic to 4-bit. You can deploy a 4-bit model and still use vllm + pagedattention to double or even triple your serving throughput.

probably mean agnostic, agonistic implies the opposite.

Re: vLLM: Easy, Fast, and Cheap LLM Serving with PagedAttention

#30
post #29
post #14

Earlier quoted context omitted.

yep, it is agonistic to 4-bit. You can deploy a 4-bit model and still use vllm + pagedattention to double or even triple your serving throughput.

probably mean agnostic, agonistic implies the opposite.

oops typo
Post reply on HN