Reconsidering "Reconsidering Custom Memory Allocation"

• URL: http://arxiv.org/abs/2605.17119v1
• Date: Sat, 16 May 2026 18:52:50 GMT
• Title: Reconsidering "Reconsidering Custom Memory Allocation"
• Abstract summary: 25 years ago, Berger et al. showed that per-class allocators provide no significant speedups over a state-of-the-art general-purpose allocator.<n>This paper revisits that work on a modern hardware platform with modern general-purpose allocators to evaluate whether their conclusions still hold.<n>It introduces a methodology to explore the effect of memory fragmentation on locality in general-purpose allocators.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Programmers using native languages such as C, C++, or Rust can implement custom memory allocation strategies to improve execution time. In their paper titled "Reconsidering Custom Memory Allocation" almost 25 years ago, Berger et al. showed that while per-class allocators provide no significant speedups over a state-of-the-art general-purpose allocator, region-based allocators can improve execution time by allocating and freeing objects in bulk. This paper revisits that work on a modern hardware platform with modern general-purpose allocators to evaluate whether their conclusions still hold. It also augments the benchmark suite with two large real-world applications (Clang and Blender), and introduces a methodology to explore the effect of memory fragmentation on locality in general-purpose allocators. Our results support and extend the original conclusions, demonstrating the locality advantages of region-based custom memory allocators.

Related papers

• Where to Look and What to Use: Retrieve-Localize-Generate for Long-Term Conversational Memory Question Answering [42.31517185994942]
  RAG enables large language models to answer questions by accessing external knowledge.<n>Existing methods suffer from two key challenges: fragmented evidence scattered across temporally distant sessions, and noisy content within retrieved sessions that triggers the lost-in-the-middle effect.<n>We propose MemLoc, a unified Retrieve-Localize-Generate framework for long-term conversational memory QA.
  arXiv  Detail & Related papers  (2026-09-07T06:32:12Z)
• Mechanistic Attention Guidance for Agent Memory Refinement [32.57216046158823]
  We show that retrieval-head attention provides a mechanistic signal for revealing segment-level memory utilization.<n>We propose Attention-Guided Memory Refinement (AGMR), a framework that uses utilization patterns revealed by attention to guide targeted segment-level memory updates.
  arXiv  Detail & Related papers  (2026-07-20T07:17:50Z)
• Learning to Retrieve: Dual-Level Long-Term Memory for Text-to-SQL Agents [63.38073530162493]
  Long-term memory helps agents reuse past experiences.<n> Static methods rely on fixed similaritys that do not optimize downstream utility.<n>We propose MERIT, a dynamic multi-horizon memory retrieval framework.
  arXiv  Detail & Related papers  (2026-05-30T05:44:34Z)
• MemGuard: Preventing Memory Contamination in Long-Term Memory-Augmented Large Language Models [56.31411457917676]
  We introduce MemGuard, a type-aware memory framework that preserves functional memory boundaries during memory construction and retrieval.<n>Across hallucination and long-horizon conversation benchmarks, MemGuard improves memory reliability by up to 28.27% while retrieving up to 5.8x fewer memory tokens than prior methods.
  arXiv  Detail & Related papers  (2026-05-27T06:04:19Z)
• EvoMemBench: Benchmarking Agent Memory from a Self-Evolving Perspective [21.66000179149483]
  EvoMemBench is a unified benchmark organized along two axes: memory scope and memory content.<n>We compare 15 representative memory methods with strong long-context baselines under a standardized protocol.<n>Results show that current memory systems are still far from a general solution.
  arXiv  Detail & Related papers  (2026-05-18T13:54:38Z)
• MemCompiler: Compile, Don't Inject -- State-Conditioned Memory for Embodied Agents [29.872311031034368]
  We propose MemCompiler, which reframes memory utilization as State-Conditioned Memory Compilation.<n>Across Alf World, EmbodiedBench, and ScienceWorld, MemCompiler consistently improves over no-memory.
  arXiv  Detail & Related papers  (2026-05-08T11:07:04Z)
• Memory Transfer Learning: How Memories are Transferred Across Domains in Coding Agents [56.078070829341534]
  Memory-based self-evolution has emerged as a promising paradigm for coding agents.<n>We investigate textbfMemory Transfer Learning (MTL) by harnessing a unified memory pool from heterogeneous domains.
  arXiv  Detail & Related papers  (2026-04-15T15:50:29Z)
• FUSELOC: Fusing Global and Local Descriptors to Disambiguate 2D-3D Matching in Visual Localization [52.57327385675752]
  Direct 2D-3D matching requires significantly less memory but suffers from lower accuracy due to the larger and more ambiguous search space.<n>We address this ambiguity by fusing local and global descriptors using a weighted average operator.<n>We achieve performance close to hierarchical methods while using 43% less memory and running 1.6 times faster.
  arXiv  Detail & Related papers  (2024-08-21T23:42:16Z)
• StarMalloc: A Formally Verified, Concurrent, Performant, and Security-Oriented Memory Allocator [3.7554217682190365]
  We show how to specify and verify StarMalloc, relying on dependent types and modular abstractions to enable efficient verification. We show that StarMalloc can be used with real-world projects, including the Firefox browser, and evaluate it against 10 state-of-the-art memory allocators.
  arXiv  Detail & Related papers  (2024-03-14T14:29:01Z)
• LaMemo: Language Modeling with Look-Ahead Memory [50.6248714811912]
  We propose Look-Ahead Memory (LaMemo) that enhances the recurrence memory by incrementally attending to the right-side tokens. LaMemo embraces bi-directional attention and segment recurrence with an additional overhead only linearly proportional to the memory length. Experiments on widely used language modeling benchmarks demonstrate its superiority over the baselines equipped with different types of memory.
  arXiv  Detail & Related papers  (2022-04-15T06:11:25Z)
• Memory Planning for Deep Neural Networks [0.0]
  We study memory allocation patterns in DNNs during inference. Latencies incurred due to such textttmutex contention produce undesirable bottlenecks in user-facing services. We present an implementation of textttMemoMalloc in the PyTorch deep learning framework.
  arXiv  Detail & Related papers  (2022-02-23T05:28:18Z)
• Efficient Regional Memory Network for Video Object Segmentation [56.587541750729045]
  We propose a novel local-to-local matching solution for semi-supervised VOS, namely Regional Memory Network (RMNet) The proposed RMNet effectively alleviates the ambiguity of similar objects in both memory and query frames. Experimental results indicate that the proposed RMNet performs favorably against state-of-the-art methods on the DAVIS and YouTube-VOS datasets.
  arXiv  Detail & Related papers  (2021-03-24T02:08:46Z)
• Kanerva++: extending The Kanerva Machine with differentiable, locally block allocated latent memory [75.65949969000596]
  Episodic and semantic memory are critical components of the human memory model. We develop a new principled Bayesian memory allocation scheme that bridges the gap between episodic and semantic memory. We demonstrate that this allocation scheme improves performance in memory conditional image generation.
  arXiv  Detail & Related papers  (2021-02-20T18:40:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.