TimelyLLM: Segmented LLM Serving System for Time-sensitive Robotic Applications

Neiwen Ling, Guojun Chen, Lin Zhong
12/24/2024
cs.ROcs.DCcs.LG

No confident code implementation found for this paper.

Abstract

Large Language Models (LLMs) such as GPT-4 and Llama3 can already comprehend complex commands and process diverse tasks. This advancement facilitates their application in controlling drones and robots for various tasks. However, existing LLM serving systems typically employ a first-come, first-served (FCFS) batching mechanism, which fails to address the time-sensitive requirements of robotic applications. To address it, this paper proposes a new system named TimelyLLM serving multiple robotic agents with time-sensitive requests. TimelyLLM introduces novel mechanisms of segmented generation and scheduling that optimally leverage redundancy between robot plan generation and execution phases. We report an implementation of TimelyLLM on a widely-used LLM serving framework and evaluate it on a range of robotic applications. Our evaluation shows that TimelyLLM improves the time utility up to 1.97x, and reduces the overall waiting time by 84%.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ling2024timelyllm,
  title  = {TimelyLLM: Segmented LLM Serving System for Time-sensitive Robotic Applications},
  author = {Neiwen Ling and Guojun Chen and Lin Zhong},
  year   = {2024},
  eprint = {2412.18695},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.18695v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.18695.svg)](https://codeofpaper.com/paper/2412.18695)

Discussion