Skip to content

E<inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="feng-ieq1-3676689.gif"/></alternatives></inline-formula>LLM: Structure-Guided Efficient Inference for LLMs in Distributed Edge

Sep 2026 · IEEE Transactions on Mobile Computing · Vol 25, pp. 14239-14253 · 0 citations · 46 references
Computer Science

Abstract

Large language models (LLMs) are increasingly deployed in edge computing environments to reduce latency and preserve privacy. However, their inference process presents fundamental challenges for resource-constrained IoT devices. LLM inference involves computationally asymmetric stages: parallelizable prompt processing and sequential token decoding. This asymmetry creates deployment bottlenecks where IoT devices lack capacity for prompt processing while edge nodes suffer from inefficient sequential decoding. This paper presents <italic>E<inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="feng-ieq3-3676689.gif"/></alternatives></inline-formula>LLM</italic>, an efficient distributed inference framework for large language models in heterogeneous edge-IoT environments. <italic>E<inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="feng-ieq4-3676689.gif"/></alternatives></inline-formula>LLM</italic> leverages high-capacity edge devices for structural planning and introduces auxiliary lightweight models to generate segment-specific key-value (KV) caches. These minimal inference artifacts enable collaborative parallel decoding across IoT devices without requiring full model instantiation. The framework employs static-dynamic KV cache separation to minimize communication overhead while maintaining semantic coherence through structure-guided coordination. Extensive evaluation on realistic edge testbeds demonstrates significant performance improvements. Under diverse deployment settings, <italic>E<inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="feng-ieq5-3676689.gif"/></alternatives></inline-formula>LLM</italic> achieves 74% –87.7% end-to-end latency reduction compared with several state-of-the-art baselines, while maintaining comparable generation quality; meanwhile, it also delivers a 34.6% –72.2% reduction in communication overhead, improves 9-12 × in energy efficiency. The framework exhibits strong scalability under bandwidth-limited conditions, enabling efficient LLM deployment across heterogeneous edge-IoT environments.

View source

Similar papers

Oct 2026

<inline-formula><tex-math notation="LaTeX">${\sf BandPilot}$</tex-math><alternatives><mml:math><mml:mi mathvariant="sans-serif">BandPilot</mml:mi></mml:math><inline-graphic xlink:href="tang-ieq1-3716225.gif"/></alternatives></inline-formula>: Toward Performance- and Contention-Aware GPU Dispatching

Modern multi-tenant AI clusters are increasingly communication-bound, driven by high-volume and multi-round GPU-to-GPU collective communication. Consequently, the GPU dispatcher’s choice of a physical GPU subset for each tenant largely determines the job’s effective collective bandwidth and thus its performance ceiling...

Kunming Zhang, Hanlong Liao, Junyu Xue et al. · 0 citations
Open access Aug 2026

The p-Modular Green Correspondence for $${\text {SL}_2(\mathbb {F}_p)}$$

<jats:p> Let <jats:italic>p</jats:italic> be an odd prime. Let <jats:inline-formula> <jats:alternatives> <jats:tex-math>$${G = SL_2(\mathbb {F}_p)}$$</jats:tex-math>...

Denver-James Logan Marchment · 0 citations
Open access Jul 2026

Condition for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mi>/</mml:mi> <mml:mi>f</mml:mi> </mml:m

While $1/f$ noise is ubiquitous and has been found in various systems, its physics remains uncertain. From an analytical study of an ordinary diffusion equation, we find an additional example of the $1/f$ noise. The formula for this example, together with existing knowledge about scaling in fluid turbulence, implies a...

H. Mouri · 0 citations
Open access Aug 2026

Core breaking at low spin in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:msup> <mml:mi/> <mml:mn>68</mml:mn> </mml:msup> </mml:math>

Low-spin excited states in $^{68}$Zn have been studied at the High Intensity Gamma-Ray Source (HI$\gamma$S) from the ground state up to the particle emission threshold using the nuclear resonance fluorescence technique (NRF) and the newly developed Clover Array. Low-spin levels were excited by linearly-polarized, $2.90...

S. R. Johnson, R. V. F. Janssens, B. Brown et al. · 0 citations
Open access Mar 2024

Arithmetic of Critical 𝑝-Adic 𝐿-Functions

<p> Our objective in the present work is to develop a fairly complete arithmetic theory of critical <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p"> <mml:semantics>...

D. Benois, Kazim Buyukboduk · 3 citations · ⚡1

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.