Searcharxiv⌕ Search

arXiv subjects

Yunxiang Yao

Publications and source records attributed to Yunxiang Yao.

2 recordsLinked to original sources

OmniInfer: System-Wide Acceleration Techniques for Optimizing LLM Serving Throughput and Latency

Large Language Models drive a wide range of modern AI applications but impose substantial challenges on large-scale serving systems due to intensive computation, strict latency constraints, and throughput bottlenecks. We introduce OmniInfer, a unified system-level acceleration framework designed to maximize end-to-end serving efficiency through fine-grained optimization of expert placement, cache compression, and scheduling. OmniInfer integrates three complementary components: OmniPlacement for load-aware Mixture-of-Experts scheduling, OmniAttn for sparse attention acceleration, and OmniProxy for disaggregation-aware request scheduling. Built atop vLLM, OmniInfer delivers system-wide performance gains through adaptive resource disaggregation, efficient sparsity exploitation, and global coordination across prefill and decode phases. Evaluated on DeepSeek-R1 within a 10-node Ascend 910C cluster, OmniInfer achieves 616 QPM, where the unified framework reduces TPOT by 36\%, and the superimposition of OmniProxy further slashes TTFT by 38\%. The project is open-sourced at [this https URL](https://gitee.com/omniai/omniinfer).

cs.DC↗

Optimal Index Assignment for Scalar Quantizers and M-PSK via a Discrete Convolution-Rearrangement Inequality

This paper investigates the problem of finding an optimal nonbinary index assignment from (M) quantization levels of a maximum entropy scalar quantizer to (M)-PSK symbols transmitted over a symmetric memoryless channel with additive noise following decreasing probability density function (such as the AWGN channel) so as to minimize the channel mean-squared distortion. The so-called zigzag mapping under maximum-likelihood (ML) decoding was known to be asymptotically optimal, but the problem of determining the optimal index assignment for any given signal-to-noise ratio (SNR) is still open. Based on a generalized version of the Hardy-Littlewood convolution-rearrangement inequality, we prove that the zigzag mapping under ML decoding is optimal for all SNRs. It is further proved that the same optimality results also hold under minimum mean-square-error (MMSE) decoding. Numerical results are presented to verify our optimality results and to demonstrate the performance gain of the optimal (M)-ary index assignment over the state-of-the-art binary counterpart for the case of (8)-PSK over the AWGN channel.

cs.IT↗