Skip to search formSkip to main contentSkip to account menu

Memory pool

Known as: Memory pools, Pool, Pool allocator 
Memory pools, also called fixed-size blocks allocation, is the use of pools for memory management that allows dynamic memory allocation comparable to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
Allocator (C++)Apache Portable RuntimeArray data structureBuddy memory allocation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Accelerating wave-propagation algorithms with adaptive mesh refinement using the Graphics Processing Unit (GPU)
Clawpack is a library for solving nonlinear hyperbolic partial differential equations using high-resolution finite volume methods… 
2016
2016
A Traversable Fixed Size Small Object Allocator in C++
At the allocation and deallocation of small objects with fixed size, the standard allocator of the runtime system has commonly a… 
2013
2013
Real-time partitioned scheduling on multi-core systems with local and global memories
Real-time task scheduling becomes even more challenging with the emerging of island-based multi-core architecture, where the… 
2012
2012
Single-pass GPU-raycasting for structured adaptive mesh refinement data
Structured Adaptive Mesh Refinement (SAMR) is a popular numerical technique to study processes with high spatial and temporal… 
2011
2011
A Memetic Particle Swarm Optimization Algorithm for Dynamic Multi-Modal Optimization Problems
Many real-world optimization problems are both dynamic and multi-modal, which require an optimization algorithm to not only find… 
2003
2003
On reducing wrapper boundary register cells in modular soc testing
  • Qiang XuN. Nicolici
  • International Test Conference, . Proceedings. ITC…
  • 2003
  • Corpus ID: 17371248
Motivated by the increasing area and performance overhead caused by wrapping the embedded cores for modular SOC testing, this… 
2000
2000
Persistence in the Grasshopper Kernel
The Grasshopper operating system provides explicit support for orthogonal persistence. A consequence of this is that the kernel… 
1997
1997
A study of virtual memory MTU reassembly within the PowerPC architecture
Message transfer unit (MTU) reassembly schemes in modern operating systems cause I/O performance degradation when MTU sizes are… 
1994
1994
Cracking and co-evolving randomizers
Cracking and Co-evolving Randomizers Jan Jannink Stanford University Computer Science Dept. Stanford, CA 94305 e-mail: jan@cs… 
Highly Cited
1992
Highly Cited
1992
Spatial machines: a more realistic approach to parallel computation
ion o f a concept that we had of a general physical compute r or "comput ing environment ." We pictured a finite set of elements… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)