Ada-MK: Adaptive MegaKernel Optimization via DAG-Based Search for LLM Inference
Ada-MK is a novel optimization framework for large language model (LLM) inference that reduces latency by eliminating kernel launch overhead through operator fusion into a single persistent kernel. It introduces a compile-time DAG-based search to determine the optimal execution path, removing runtime branching and improving efficiency on resource-constrained GPUs. The system has been successfully deployed in a commercial online advertising setting, demonstrating consistent performance gains over existing inference engines.
- ▪Ada-MK reduces peak shared memory usage by 50% using a three-dimensional shared-memory constraint model and K-dimension splitting.
- ▪The framework uses MLIR-based offline DAG search to eliminate runtime branching, enhancing performance in latency-sensitive applications.
- ▪Ada-MK integrates with TensorRT-LLM as a plugin, combining high-throughput prefill and low-latency decode phases.
- ▪On an NVIDIA L20 GPU, Ada-MK achieves up to 23.6% higher throughput than TensorRT-LLM and 50.2% over vLLM.
- ▪It marks the first industrial deployment of MegaKernel technology in a commercial online advertising system.
Hacker News (AI / LLM) files mainly under ai. We currently carry 3,301 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv.org |
| Canonical URL | https://arxiv.org/abs/2605.11581 |
| Publication time | Sat, 16 May 2026 16:54:21 +0000 |
| Retrieval time | 2026-05-16T17:00:18.968Z |
| Last seen | 2026-05-16T17:00:18.968Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | N67cKTls0NyD |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Computation and Language arXiv:2605.11581 (cs) [Submitted on 12 May 2026] Title:Ada-MK: Adaptive MegaKernel Optimization via Automated DAG-based Search for LLM Inference Authors:Wenxin Dong, Mingqing Hu, Guanghui Yu, Qiang Fu, Peng Xu, Hui Xu, Yue Xing, Xuewu Jiao, Shuanglong Li, Lin Liu View a PDF of the paper titled Ada-MK: Adaptive MegaKernel Optimization via Automated DAG-based Search for LLM Inference, by Wenxin Dong and 8 other authors View PDF HTML (experimental) Abstract:When large language models (LLMs) serve real-time inference in commercial online advertising systems, end-to-end latency must be strictly bounded to the millisecond range.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv.org.
Discussion
0 commentsMore from arXiv.org
