ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “cache-friendly”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DBcs.DSEmpiricalRecentJun 15, 2026

C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression

Kepan Zhang, Tiancheng Zhao, Helen Xu

This paper proposes C^2, a set of techniques to improve the spatial locality of succinct tries, resulting in faster query performance and reduced memory footprint.

View →
cs.DCEmpiricalRecentJun 11, 2026

Skiplists with Foresight: Skipping Cache Misses

Tomer Cory, Niv Sulimany, Erez Petrank

This paper introduces Foresight, a cache-friendly skiplist optimization that improves performance in sequential and concurrent settings.

View →
cs.DCEmpiricalRecentJul 28, 2026

CW-Ghost: Search-Free Granularity Selection for Helper-Thread Prefetching via Capacity Windows

Ya Zhang, Tong Lei, Yao Chen, Yonggang Che +3 more

This paper introduces CW-Ghost, a method for estimating cache line fill volume and determining helper-thread prefetching granularity based on cache capacity constraints.

View →
cs.DBcs.DCcs.DSEmpiricalRecentJul 7, 2026

Efficient and Robust Lock-Free Multi-Word Compare-and-Swap via Contention-Aware Helping

Motoki Unno, Kento Sugiura, Yoshiharu Ishikawa

This paper introduces a new lock-free multi-word compare-and-swap algorithm with a contention-aware helping mechanism and version embedding approach to improve efficiency and consistency, achieving up…

View →
cs.DCcs.OSEmpiricalRecentJun 15, 2026

CacheWise: Understanding Workloads and Optimizing KVCache Management for Efficiently Serving LLM Coding Agents

Shubham Tiwari, Tapan Chugh, Nash Rickert, Simon Peter +2 more

This paper presents a new KVCache management layer called CacheWise that improves performance for coding agent workloads.

View →
cs.ITTheoreticalRecentOct 9, 2026

Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files

Tati V D N Eswar, Jithin Ravi

The paper characterizes the memory-rate trade-off for demand-private coded caching with heterogeneous file sizes and cache capacities.

View →
cs.CRRecentMay 26, 2026

Cloak: Heuristic ORAM Optimization Through Fixed Temporal Distribution

Onur Eren Arpaci, Florian Kerschbaum, Sujaya Maiyya

Cloak is an oblivious storage system that significantly improves the performance of ORAM by exploiting temporal locality, achieving low overheads while maintaining security.

View →
cs.CRcs.AREmpiricalRecentJun 10, 2026

Partitioned Tags, Shared Data: Reconciling Strict Cache Isolation with Write-Shared Coherence

Kartik Ramkrishnan, Stephen McCamant, Antonia Zhai, Pen Chung Yew

This paper presents SCP, a cache partitioning design that combines strict eviction isolation with write-shared coherence to mitigate eviction-based cache side channels.

View →
cs.DCcs.DSTheoreticalRecentJun 15, 2026

Space-Efficient Lock-Free Linear-Probing Hash Table

Hagit Attiya, Rotem Oshman, Noa Schiller

This paper presents a lock-free linear-probing hash table with wait-free lookups, using a small amount of metadata and maintaining space efficiency.

View →
cs.CRRecentMay 22, 2026

CachePrune: Privacy-Aware and Fine-Grained KV Cache Sharing for Efficient LLM Inference

Guanlong Wu, Zhaohan li, Yao Zhang, Zheng Zhang +3 more

CachePrune introduces a privacy-aware, fine-grained KV cache sharing mechanism that allows LLM inference systems to safely reuse cache entries across users' requests, significantly improving efficienc…

View →
cs.IRcs.CLcs.LGEmpiricalRecentJun 18, 2026

Closing the Calibration Gap in Semantic Caching

Aditeya Baral, Radoslav Ralev, Iliya Sotirov Zhechev, Srijith Rajamohan +1 more

This paper introduces new metrics to evaluate semantic caching systems and shows that model selection is a calibration problem, not a ranking one.

View →
cs.ARcs.CREmpiricalRecentJun 17, 2026

CHERI-D: Secure and efficient inline object ID for CHERI temporal memory safety

Yuecheng Wang, Jonathan Woodruff, Alfredo Mazzinghi, Peter Rugg +4 more

The paper proposes CHERI-D, an architectural extension to CHERI that supports efficient temporal memory safety.

View →
cs.CRcs.AIcs.CLRecentMay 26, 2026

Grounded Cache Routing for Retrieval-Augmented Generation: When Is It Safe to Reuse an Answer?

Syed Huma Shah

The paper proposes GroundedCache, an evidence-validated cache router that significantly improves the safety of reusing cached semantic answers in RAG systems by requiring multiple gates to validate th…

View →
cs.OSEmpiricalRecentOct 18, 2026

Visual Cache Reuse for Efficient Multimodal Inference

Shuheng Gao, Yuankai Fan, Jiaqiang Ma, Jiawei Shao +2 more

VisMemo is a serving system that enables approximate KV cache reuse for modern vision-language models to reduce prefill latency and memory overhead.

View →
cs.AIcs.PLEmpiricalRecentOct 16, 2026

Where Does the Performance Go? Understanding and Recovering Performance Regressions in C-to-Rust Translation

Zhiqiang Yuan, Chong Wang, Zhenhao Zhou, Junwei Liu +1 more

This paper studies the performance gap between C and Rust code generated by a transpiler and proposes an LLM-based approach to recover the performance of translated Rust.

View →
cs.ARcs.OSEmpiricalRecentJul 31, 2026

Themis: Software-Defined Hardware Prefetching

Keisuke Kamahori, Neil Adit, Kan Zhu, Yuqi Mai +12 more

A new hardware-software interface for data prefetching is proposed to reduce useless prefetches in datacenter workloads by 40%.

View →
cs.DCEmpiricalRecentOct 30, 2026

HiState: Hierarchical Prefix Cache Management for Hybrid LLM Serving in Agentic Workloads

Zaifeng Pan, Lucas Wang, Xinwei Qiang, Yanbo Zhou +4 more

This paper presents HiState, a prefix cache management system for hybrid models serving agent workloads to reduce inference costs.

View →
cs.OSEmpiricalRecentMay 30, 2026

Idleness is Relative: Exploiting Tool-Call Idle Windows for Offloading in Agentic Systems with MORI

Tian Xia, Hanchen Li, Zhifei Li, Xiaokun Chen +4 more

MORI is a system that optimizes memory allocation for agentic workloads in LLM serving systems by dynamically shifting the partition boundary between GPU HBM and CPU DRAM based on program idleness.

View →
cs.DScs.DCcs.MSEmpiricalRecentJul 27, 2026

Right Multiplication on Grammar-Compressed Matrices: A Streaming, Memory-Bounded GPU Engine

Francesco Tosoni, Gabriele Mencagli

This paper presents a method for compressing matrices using a RePair straight-line program (SLP), allowing matrix-vector products with time and space proportional to the compressed size, and demonstra…

View →