SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2408.15792 · 2024

Efficient LLM Scheduling by Learning to Rank

arXiv · PDF · Open in the Atlas

Code that ran

None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2408.15792.json · badge: /api/ran/2408.15792.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
hao-ai-lab/vllm-ltr canonical (classifier label)
classifier basis: census
0 ran · 3 no recorded run
FunctionStatusWhere it lives
awq_dequantize Not yet run
unverified (harvested, no recorded run)
hao-ai-lab/vllm-ltr/vllm/_custom_ops.py
code served (permissive licence) · get_code("c382c6353e8cccb0")
How it ran

no invocation recorded.

awq_gemm Not yet run
unverified (harvested, no recorded run)
hao-ai-lab/vllm-ltr/vllm/_custom_ops.py
code served (permissive licence) · get_code("f3fcfeaca594c86f")
How it ran

no invocation recorded.

gptq_gemm Not yet run
unverified (harvested, no recorded run)
hao-ai-lab/vllm-ltr/vllm/_custom_ops.py
code served (permissive licence) · get_code("4def2cf22c36f4e8")
How it ran

no invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
awq_dequantize 2 other papers
1 dated earlier, 1 later
2405.16444 (2024-05)
CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion
2410.00428 (2024-10)
LayerKV: Optimizing Large Language Model Serving with Layer-wise KV Cache Management
awq_gemm 2 other papers
1 dated earlier, 1 later
2405.16444 (2024-05)
CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion
2410.00428 (2024-10)
LayerKV: Optimizing Large Language Model Serving with Layer-wise KV Cache Management
gptq_gemm 2 other papers
1 dated earlier, 1 later
2405.16444 (2024-05)
CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion
2410.00428 (2024-10)
LayerKV: Optimizing Large Language Model Serving with Layer-wise KV Cache Management

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

In Large Language Model (LLM) inference, the output length of an LLM request is typically regarded as not known a priori. Consequently, most LLM serving systems employ a simple First-come-first-serve (FCFS) scheduling strategy, leading to Head-Of-Line (HOL) blocking and reduced throughput and service quality. In this paper, we reexamine this assumption -- we show that, although predicting the exact generation length of each request is infeasible, it is possible to predict the relative ranks of output lengths in a batch of requests, using learning to rank. The ranking information offers valuable guidance for scheduling requests. Building on this insight, we develop a novel scheduler for LLM inference and serving that can approximate the shortest-job-first (SJF) schedule better than existing approaches. We integrate this scheduler with the state-of-the-art LLM serving system and show significant performance improvement in several important applications: 2.8x lower latency in chatbot serving and 6.5x higher throughput in synthetic data generation. Our code is available at https://github.com/hao-ai-lab/vllm-ltr.git

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2408.15792")
get_code_for_paper("2408.15792")
have("2408.15792")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2408.15792.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2408.15792.svg)](https://syntology.ai/paper/2408.15792)

Connect an agent — have() is free.