Related Experiment Video
Updated: Jun 3, 2026

03:14
Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
Published on: December 6, 2024
Dynamic Micro-Batch and Token-Budget Scheduling for IoT-Scale Pipeline-Parallel LLM Inference
Juncheol Ahn1, Yubin Son1, Daemin Kim1
1System Software Laboratory, Department of Computer Engineering, Keimyung University, Daegu 42601, Republic of Korea.
Sensors (Basel, Switzerland)
|February 27, 2026
Summary
We developed a runtime-adaptive scheduler for large language models (LLMs) in IoT-edge-cloud settings. This dynamic scheduling significantly reduces GPU idle time and improves throughput for LLM inference.
Area of Science:
- Computer Science
- Artificial Intelligence
- Distributed Systems
Background:
- Large language models (LLMs) in IoT-edge-cloud environments handle diverse, unpredictable requests.
- Pipeline-parallel LLM inference is susceptible to micro-batch imbalance and communication delays, leading to GPU idleness and Service Level Objective (SLO) violations.
Purpose of the Study:
- To propose a novel runtime-adaptive scheduler for optimizing LLM inference in resource-constrained IoT-edge-cloud settings.
- To address micro-batch imbalance and communication stalls in pipeline-parallel LLM inference.
Main Methods:
- Developed a scheduler that dynamically adjusts token budgets and micro-batch sizes.
- Optimized the balance between prefill and decoding workloads.
- Minimized pipeline bubbles under varying network and compute conditions.
Main Results:
- Achieved up to 55% reduction in GPU idle time.
- Improved throughput by up to 1.61 times compared to existing methods like vLLM and SGLang.
- Enhanced Time-To-First-Token (TTFT) and Iteration Latency (ITL) SLO satisfaction.
Conclusions:
- Dynamic scheduling is crucial for efficient and stable LLM inference in IoT-edge-cloud systems.
- The proposed adaptive scheduler effectively mitigates performance bottlenecks in heterogeneous request environments.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
372
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
372
Parallel Processing
819
The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
819
Rapidly Varying Flow
561
Rapidly varying flow (RVF) in open channels is characterized by abrupt changes in flow depth over a short distance, with the rate of depth change relative to distance often approaching unity. These flows are inherently complex due to their transient and multi-dimensional nature, making exact analysis difficult. However, approximate solutions using simplified models provide valuable insights into their behavior.Key Features of Rapidly Varying FlowRVF is commonly observed in scenarios involving...
561