arXiv CS
open access
PageWeaver: KV-Guided Query Unions for Sparse Attention
Dynamic sparse attention limits the KV pages selected by each query, but a small support does not necessarily yield efficient GPU work. Query unions share page loads and populate Tensor Core tiles; their cost depends on which queries are grouped together. We present PageWeaver, an execution design t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- PageWeaver: KV-Guided Query Unions for Sparse Attention#1248128
- Vortex: Efficient and Programmable Sparse Attention Serving for AI Agents#259507
- GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs#2775
- QEmbed: A Deep Learning Based Cardinality Estimator for Efficient Query Processing#1070030
- QEmbed: A Deep Learning Based Cardinality Estimator for Efficient Query Processing#919526
Record · ID 1257935
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive