ForkParasailParasailpublished Apr 23, 2024seen 5d

parasail-ai/vllm-public

forked from vllm-project/vllm

Open original ↗

Captured source

source ↗
published Apr 23, 2024seen 5dcaptured 9hhttp 200method exa

Repository: parasail-ai/vllm-public (fork of vllm-project/vllm)

A high-throughput and memory-efficient inference and serving engine for LLMs

  • Stars: 0
  • Forks: 0
  • Watchers: 0
  • Open issues: 0
  • Primary language: Python
  • Languages: Python (80.0%), Cuda (14.9%), C++ (2.9%), C (0.9%), Shell (0.9%), CMake (0.3%), Dockerfile (0.1%)
  • License: Apache License 2.0 (Apache-2.0)
  • Default branch: main
  • Homepage: https://docs.vllm.ai
  • Created: 2024-04-23T18:46:20Z
  • Last push: 2024-09-01T03:35:29Z
  • Contributors: 460 (top: WoosukKwon, youkaichao, zhuohan123, simon-mo, DarkLight1337, Yard1, mgoin, njhill, robertgshaw2-redhat, ywang96)

---

Easy, fast, and cheap LLM serving for everyone

| Documentation | Blog | Paper | Discord | Twitter/X |

---

vLLM & NVIDIA Triton User Meetup (Monday, September 9, 5pm-9pm PT) at Fort Mason, San Francisco

We are excited to announce our sixth vLLM Meetup, in collaboration with NVIDIA Triton Team. Join us to hear the vLLM's recent update about performance. Register now here and be part of the event!

---

*Latest News* 🔥

---

About

vLLM is a fast and easy-to-use library for LLM inference and serving.

vLLM is fast with:

  • State-of-the-art serving throughput
  • Efficient management of attention key and value memory with PagedAttention
  • Continuous batching of incoming requests
  • Fast model execution with CUDA/HIP graph
  • Quantizations: GPTQ, AWQ, INT4, INT8, and FP8.
  • Optimized CUDA kernels, including integration with FlashAttention and FlashInfer.
  • Speculative decoding
  • Chunked prefill

Performance benchmark: We include a performance benchmark that compares the performance of vLLM against other LLM serving engines (TensorRT-LLM, text-generation-inference and lmdeploy).

vLLM is flexible and easy to use with:

  • Seamless integration with popular Hugging Face models
  • High-throughput serving with various decoding algorithms, including *parallel sampling*, *beam search*, and more
  • Tensor parallelism and pipeline parallelism support for distributed inference
  • Streaming outputs
  • OpenAI-compatible API server
  • Support NVIDIA GPUs, AMD CPUs and GPUs, Intel CPUs and GPUs, PowerPC CPUs, TPU, and AWS Neuron.
  • Prefix caching support
  • Multi-lora support

vLLM seamlessly supports most popular open-source models on HuggingFace, including:

  • Transformer-like LLMs (e.g., Llama)
  • Mixture-of-Expert LLMs (e.g., Mixtral)
  • Embedding Models (e.g. E5-Mistral)
  • Multi-modal LLMs (e.g., LLaVA)

Find the full list of supported models here.

Getting Started

Install vLLM with pip or from source:

pip install vllm

Visit our documentation to learn more.

Contributing

We welcome and value any contributions and collaborations. Please check out [CONTRIBUTING.md](./CONTRIBUTING.md) for how to get involved.

Sponsors

vLLM is a community project. Our compute resources for development and testing are supported by the following organizations. Thank you for your support!

  • a16z
  • AMD
  • Anyscale
  • AWS
  • Crusoe Cloud
  • Databricks
  • DeepInfra
  • Dropbox
  • Google Cloud
  • Lambda Lab
  • NVIDIA
  • Replicate
  • Roblox
  • RunPod
  • Sequoia Capital
  • Skywork AI
  • Trainy
  • UC Berkeley
  • UC San Diego
  • ZhenFund

We also have an official fundraising venue through OpenCollective. We plan to use the fund to support the development, maintenance, and adoption of vLLM.

Citation

If you use vLLM for your research, please cite our paper:

@inproceedings{kwon2023efficient,
title={Efficient Memory Management for Large Language Model Serving with PagedAttention},
author={Woosuk Kwon and Zhuohan Li and Siyuan Zhuang and Ying Sheng and Lianmin Zheng and Cody Hao Yu and Joseph E. Gonzalez and Hao Zhang and Ion Stoica},
booktitle={Proceedings of the ACM SIGOPS 29th Symposium on Operating Systems…

Excerpt shown — open the source for the full document.