Loading…

Splitwise: Efficient generative LLM inference using phase splitting

Recent innovations in generative large language models (LLMs) have made their applications and use-cases ubiquitous. This has led to large-scale deployments of these models, using complex, expensive, and power-hungry AI accelerators, most commonly GPUs. These developments make LLM inference efficien...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-05
Main Authors: Patel, Pratyush, Choukse, Esha, Zhang, Chaojie, Shah, Aashaka, Goiri, Íñigo, Maleki, Saeed, Bianchini, Ricardo
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Patel, Pratyush
Choukse, Esha
Zhang, Chaojie
Shah, Aashaka
Goiri, Íñigo
Maleki, Saeed
Bianchini, Ricardo
description Recent innovations in generative large language models (LLMs) have made their applications and use-cases ubiquitous. This has led to large-scale deployments of these models, using complex, expensive, and power-hungry AI accelerators, most commonly GPUs. These developments make LLM inference efficiency an important challenge. Based on our extensive characterization, we find that there are two main phases during an LLM inference request: a compute-intensive prompt computation, and a memory-intensive token generation, each with distinct latency, throughput, memory, and power characteristics. Despite state-of-the-art batching and scheduling, the token generation phase underutilizes compute resources. Specifically, unlike compute-intensive prompt computation phases, token generation phases do not require the compute capability of the latest GPUs, and can be run with lower power and cost. With Splitwise, we propose splitting the two phases of a LLM inference request on to separate machines. This allows us to use hardware that is well-suited for each phase, and provision resources independently per phase. However, splitting an inference request across machines requires state transfer from the machine running prompt computation over to the machine generating tokens. We implement and optimize this state transfer using the fast back-plane interconnects available in today's GPU clusters. We use the Splitwise technique to design LLM inference clusters using the same or different types of machines for the prompt computation and token generation phases. Our clusters are optimized for three key objectives: throughput, cost, and power. In particular, we show that we can achieve 1.4x higher throughput at 20% lower cost than current designs. Alternatively, we can achieve 2.35x more throughput with the same cost and power budgets.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2896043949</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2896043949</sourcerecordid><originalsourceid>FETCH-proquest_journals_28960439493</originalsourceid><addsrcrecordid>eNqNi8EKgkAURYcgSMp_eNBamGbUtK0YLWxVexF5Y09ktHlj_X4GfUCry-GcuxKB0voQZbFSGxEy91JKlR5VkuhAFLdpIP8mxhOUxlBLaD10aNE1nl4IVXUFsgYd2hZhZrIdTI-GEfj79AvvxNo0A2P4263Yn8t7cYkmNz5nZF_34-zsomqV5amMdR7n-r_qAw5eOnI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2896043949</pqid></control><display><type>article</type><title>Splitwise: Efficient generative LLM inference using phase splitting</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><creator>Patel, Pratyush ; Choukse, Esha ; Zhang, Chaojie ; Shah, Aashaka ; Goiri, Íñigo ; Maleki, Saeed ; Bianchini, Ricardo</creator><creatorcontrib>Patel, Pratyush ; Choukse, Esha ; Zhang, Chaojie ; Shah, Aashaka ; Goiri, Íñigo ; Maleki, Saeed ; Bianchini, Ricardo</creatorcontrib><description>Recent innovations in generative large language models (LLMs) have made their applications and use-cases ubiquitous. This has led to large-scale deployments of these models, using complex, expensive, and power-hungry AI accelerators, most commonly GPUs. These developments make LLM inference efficiency an important challenge. Based on our extensive characterization, we find that there are two main phases during an LLM inference request: a compute-intensive prompt computation, and a memory-intensive token generation, each with distinct latency, throughput, memory, and power characteristics. Despite state-of-the-art batching and scheduling, the token generation phase underutilizes compute resources. Specifically, unlike compute-intensive prompt computation phases, token generation phases do not require the compute capability of the latest GPUs, and can be run with lower power and cost. With Splitwise, we propose splitting the two phases of a LLM inference request on to separate machines. This allows us to use hardware that is well-suited for each phase, and provision resources independently per phase. However, splitting an inference request across machines requires state transfer from the machine running prompt computation over to the machine generating tokens. We implement and optimize this state transfer using the fast back-plane interconnects available in today's GPU clusters. We use the Splitwise technique to design LLM inference clusters using the same or different types of machines for the prompt computation and token generation phases. Our clusters are optimized for three key objectives: throughput, cost, and power. In particular, we show that we can achieve 1.4x higher throughput at 20% lower cost than current designs. Alternatively, we can achieve 2.35x more throughput with the same cost and power budgets.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Backplanes ; Clusters ; Computation ; Inference ; Large language models ; Phases ; Splitting</subject><ispartof>arXiv.org, 2024-05</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by-nc-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2896043949?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Patel, Pratyush</creatorcontrib><creatorcontrib>Choukse, Esha</creatorcontrib><creatorcontrib>Zhang, Chaojie</creatorcontrib><creatorcontrib>Shah, Aashaka</creatorcontrib><creatorcontrib>Goiri, Íñigo</creatorcontrib><creatorcontrib>Maleki, Saeed</creatorcontrib><creatorcontrib>Bianchini, Ricardo</creatorcontrib><title>Splitwise: Efficient generative LLM inference using phase splitting</title><title>arXiv.org</title><description>Recent innovations in generative large language models (LLMs) have made their applications and use-cases ubiquitous. This has led to large-scale deployments of these models, using complex, expensive, and power-hungry AI accelerators, most commonly GPUs. These developments make LLM inference efficiency an important challenge. Based on our extensive characterization, we find that there are two main phases during an LLM inference request: a compute-intensive prompt computation, and a memory-intensive token generation, each with distinct latency, throughput, memory, and power characteristics. Despite state-of-the-art batching and scheduling, the token generation phase underutilizes compute resources. Specifically, unlike compute-intensive prompt computation phases, token generation phases do not require the compute capability of the latest GPUs, and can be run with lower power and cost. With Splitwise, we propose splitting the two phases of a LLM inference request on to separate machines. This allows us to use hardware that is well-suited for each phase, and provision resources independently per phase. However, splitting an inference request across machines requires state transfer from the machine running prompt computation over to the machine generating tokens. We implement and optimize this state transfer using the fast back-plane interconnects available in today's GPU clusters. We use the Splitwise technique to design LLM inference clusters using the same or different types of machines for the prompt computation and token generation phases. Our clusters are optimized for three key objectives: throughput, cost, and power. In particular, we show that we can achieve 1.4x higher throughput at 20% lower cost than current designs. Alternatively, we can achieve 2.35x more throughput with the same cost and power budgets.</description><subject>Backplanes</subject><subject>Clusters</subject><subject>Computation</subject><subject>Inference</subject><subject>Large language models</subject><subject>Phases</subject><subject>Splitting</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNi8EKgkAURYcgSMp_eNBamGbUtK0YLWxVexF5Y09ktHlj_X4GfUCry-GcuxKB0voQZbFSGxEy91JKlR5VkuhAFLdpIP8mxhOUxlBLaD10aNE1nl4IVXUFsgYd2hZhZrIdTI-GEfj79AvvxNo0A2P4263Yn8t7cYkmNz5nZF_34-zsomqV5amMdR7n-r_qAw5eOnI</recordid><startdate>20240520</startdate><enddate>20240520</enddate><creator>Patel, Pratyush</creator><creator>Choukse, Esha</creator><creator>Zhang, Chaojie</creator><creator>Shah, Aashaka</creator><creator>Goiri, Íñigo</creator><creator>Maleki, Saeed</creator><creator>Bianchini, Ricardo</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20240520</creationdate><title>Splitwise: Efficient generative LLM inference using phase splitting</title><author>Patel, Pratyush ; Choukse, Esha ; Zhang, Chaojie ; Shah, Aashaka ; Goiri, Íñigo ; Maleki, Saeed ; Bianchini, Ricardo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28960439493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Backplanes</topic><topic>Clusters</topic><topic>Computation</topic><topic>Inference</topic><topic>Large language models</topic><topic>Phases</topic><topic>Splitting</topic><toplevel>online_resources</toplevel><creatorcontrib>Patel, Pratyush</creatorcontrib><creatorcontrib>Choukse, Esha</creatorcontrib><creatorcontrib>Zhang, Chaojie</creatorcontrib><creatorcontrib>Shah, Aashaka</creatorcontrib><creatorcontrib>Goiri, Íñigo</creatorcontrib><creatorcontrib>Maleki, Saeed</creatorcontrib><creatorcontrib>Bianchini, Ricardo</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Patel, Pratyush</au><au>Choukse, Esha</au><au>Zhang, Chaojie</au><au>Shah, Aashaka</au><au>Goiri, Íñigo</au><au>Maleki, Saeed</au><au>Bianchini, Ricardo</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Splitwise: Efficient generative LLM inference using phase splitting</atitle><jtitle>arXiv.org</jtitle><date>2024-05-20</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>Recent innovations in generative large language models (LLMs) have made their applications and use-cases ubiquitous. This has led to large-scale deployments of these models, using complex, expensive, and power-hungry AI accelerators, most commonly GPUs. These developments make LLM inference efficiency an important challenge. Based on our extensive characterization, we find that there are two main phases during an LLM inference request: a compute-intensive prompt computation, and a memory-intensive token generation, each with distinct latency, throughput, memory, and power characteristics. Despite state-of-the-art batching and scheduling, the token generation phase underutilizes compute resources. Specifically, unlike compute-intensive prompt computation phases, token generation phases do not require the compute capability of the latest GPUs, and can be run with lower power and cost. With Splitwise, we propose splitting the two phases of a LLM inference request on to separate machines. This allows us to use hardware that is well-suited for each phase, and provision resources independently per phase. However, splitting an inference request across machines requires state transfer from the machine running prompt computation over to the machine generating tokens. We implement and optimize this state transfer using the fast back-plane interconnects available in today's GPU clusters. We use the Splitwise technique to design LLM inference clusters using the same or different types of machines for the prompt computation and token generation phases. Our clusters are optimized for three key objectives: throughput, cost, and power. In particular, we show that we can achieve 1.4x higher throughput at 20% lower cost than current designs. Alternatively, we can achieve 2.35x more throughput with the same cost and power budgets.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2024-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2896043949
source Publicly Available Content Database (Proquest) (PQ_SDU_P3)
subjects Backplanes
Clusters
Computation
Inference
Large language models
Phases
Splitting
title Splitwise: Efficient generative LLM inference using phase splitting
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T02%3A01%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Splitwise:%20Efficient%20generative%20LLM%20inference%20using%20phase%20splitting&rft.jtitle=arXiv.org&rft.au=Patel,%20Pratyush&rft.date=2024-05-20&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2896043949%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_28960439493%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2896043949&rft_id=info:pmid/&rfr_iscdi=true