paper-with-me

Papers

COREY: Entropy-Guided Runtime Chunk Scheduling for Selective Scan Kernels

2026-04-12 · Bo Ma, Jinsong Wu, Weiqi Yan arxiv

Mamba selective state space models (SSMs) provide linear-time sequence modeling but remain sensitive to selective-scan chunk scheduling. We present COREY, a \emph{concept-and-feasibility} runtime scheduler that maps fixed-bin activation entropy to chunk size. We evaluate COREY in three tiers: a prototype cost model, real-checkpoint kernel timing, and routed end-to-end ablations on modern GPUs. At the kernel level, a calibrated rule, \(H_{\mathrm{ref}}=\log K\), recovers the locally optimal chunk and matches a one-time static oracle, yielding \(4.41\times\) lower latency than an unoptimized baseline on a consumer GPU and \(3.90\times\)--\(4.04\times\) lower latency on a data-center accelerator. Routing this choice into a patched live scan kernel closes the engineering loop without improving end-to-end speed: in unified routed ablations, the best static chunk outperforms all entropy-guided and proxy schedulers. Sampled-histogram COREY adds \(+4.6\%\) overhead; a guarded fallback to Static-512 reduces this to \(+1.3\%\); and a lightweight sequence-length-keyed table further reduces it to \(+0.7\%\). However, both remain slower than the static oracle because they retain scheduling cost. On an 80-prompt LongBench subset, passive and routed inference are exactly output-equivalent, with \(100\%\) greedy-token agreement and zero metric deltas. A mixed-regime study shows that a single sequence-length rule matches the per-regime chunk oracle for balanced serving. COREY is therefore validated as a quality-preserving scheduling prototype, but current entropy statistics are not a robust throughput win over static chunk tuning on measured SSM checkpoint workloads. SourceCode: https://github.com/mabo1215/COREY_Transformer/.

📄 PDF Abstract BibTeX arXiv:2604.10597

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

ChunkFlow: Communication-Aware Chunked Prefetching for Layerwise Offloading in Distributed Diffusion Transformer Inference

2026-05-11 · Han Meng, Danny Willow Liu, Dong Li arxiv

Layerwise offloading reduces the GPU memory footprint of large diffusion transformer (DiT) inference by prefetching upcoming layers from host memory, but its effectiveness hinges on hiding prefetch latency behind per-lay…

Scheduling optimization of parallel linear algebra algorithms using Supervised Learning

2019-09-09 · G. Laberge, S. Shirzad, P. Diehl, H. Kaiser 외

Linear algebra algorithms are used widely in a variety of domains, e.g machine learning, numerical physics and video games graphics. For all these applications, loop-level parallelism is required to achieve high performa…

Scheduling

G3AR: Graph-Guided Neural Visual Geometry for Scalable Multi-Sequence Aerial Registration

2026-09-15 · Jeng Wen Joshua Lean, Ting-Yu Yen, Wei-Fang Sun, Simon See 외 arxiv

Full-context neural visual geometry is impractical for thousands of images, while sequence-based chunking poorly captures irregular non-local overlap in multi-sequence aerial collections. We present Graph-Guided Neural V…

TurboServe: Serving Streaming Video Generation Efficiently and Economically

2026-06-17 · Youhe Jiang, Haoxu Wang, Haotong Bao, Kai Jiang 외 hf

Streaming video generation is emerging as a new serving workload in which users interact with long-lived sessions that generate video progressively, chunk by chunk. Unlike offline video generation or typical LLM serving,…

Video Generation

Action Chunk Scheduling for Batched Robot Policy Serving

2026-07-31 · Rohan Bansal, David He, Nadun Ranawaka Arachchige, Zhenyang Chen 외 arxiv

Deploying robot foundation models at scale is the next step towards realizing the potential of general-purpose robots. However, Vision-Language-Action (VLA) and other foundation models are computationally demanding, and …