Pith. sign in

REVIEW 1 cited by

LLMSched: Uncertainty-Aware Workload Scheduling for Compound LLM Applications

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.03444 v2 pith:5C7AUSEO submitted 2025-04-04 cs.DC

classification cs.DC
keywords applicationscompoundllmschedschedulinguncertaintyaverageefficientmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Developing compound Large Language Model (LLM) applications is becoming an increasingly prevalent approach to solving real-world problems. In these applications, an LLM collaborates with various external modules, including APIs and even other LLMs, to realize complex intelligent services. However, we reveal that the intrinsic duration and structural uncertainty in compound LLM applications pose great challenges for LLM service providers in serving and scheduling them efficiently. In this paper, we propose LLMSched, an uncertainty-aware scheduling framework for emerging compound LLM applications. In LLMSched, we first design a novel DAG-based model to describe the uncertain compound LLM applications. Then, we adopt the Bayesian network to comprehensively profile compound LLM applications and identify uncertainty-reducing stages, along with an entropy-based mechanism to quantify their uncertainty reduction. Combining an uncertainty reduction strategy and a job completion time (JCT)-efficient scheme, we further propose an efficient scheduler to reduce the average JCT. Evaluation of both simulation and testbed experiments on various representative compound LLM applications shows that compared to existing state-of-the-art scheduling schemes, LLMSched can reduce the average JCT by 14~79%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Evaluating the Efficacy of LLM-Based Reasoning for Multiobjective HPC Job Scheduling

    cs.DC 2025-05 conditional novelty 6.0 of 10

    ReAct-style LLM schedulers can balance multiple HPC scheduling objectives on 10-100 job workloads, though cloud API latency makes them unsuitable for real-time deployment.

Pith tools