20 results for “cache-friendly”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
This paper introduces Foresight, a cache-friendly skiplist optimization that improves performance in sequential and concurrent settings.
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.
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…
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.
The paper characterizes the memory-rate trade-off for demand-private coded caching with heterogeneous file sizes and cache capacities.
Cloak is an oblivious storage system that significantly improves the performance of ORAM by exploiting temporal locality, achieving low overheads while maintaining security.
This paper presents SCP, a cache partitioning design that combines strict eviction isolation with write-shared coherence to mitigate eviction-based cache side channels.
This paper presents a lock-free linear-probing hash table with wait-free lookups, using a small amount of metadata and maintaining space efficiency.
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…
This paper introduces new metrics to evaluate semantic caching systems and shows that model selection is a calibration problem, not a ranking one.
The paper proposes CHERI-D, an architectural extension to CHERI that supports efficient temporal memory safety.
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…
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.
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.
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%.
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.
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.
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…