Transparent Pooling in User Controlled Heaps
Original Publication Date: 1996-Aug-01
Included in the Prior Art Database: 2005-Mar-31
Most memory management algorithms treat all sizes equally with respect to allocation policies. In practice, applications tend to allocate objects of many sizes, yet few sizes will dominate all the allocations required for the program. Therefore, if the user can indicate the range of preferred sizes to the memory allocator for pooling, performance can be greatly improved during allocation and deallocation of objects, thus resulting in faster execution and reduced page swapping.