Using lifetime predictors to improve memory allocation performance
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
The memory fragmentation problem: solved?
Proceedings of the 1st international symposium on Memory management
Memory allocation for long-running server applications
Proceedings of the 1st international symposium on Memory management
ACM Computing Surveys (CSUR)
A dynamic storage allocation technique based on memory residence time
Communications of the ACM
A comparison of next-fit, first-fit, and best-fit
Communications of the ACM
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
Communications of the ACM
An efficient data structure for dynamic memory management
Journal of Systems and Software
An efficient data structure for dynamic memory management
Journal of Systems and Software
Composing high-performance memory allocators
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
A study of the allocation behavior of C++ programs
Journal of Systems and Software
A High-Performance Memory Allocator for Object-Oriented Systems
IEEE Transactions on Computers
Optimizing Dynamic Memory Management in a Multithreaded Application Executing on a Multiprocessor
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Dynamic Storage Allocation: A Survey and Critical Review
IWMM '95 Proceedings of the International Workshop on Memory Management
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
New methods for dynamic storage allocation (Fast Fits)
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Efficient Algorithms for Persistent Storage Allocation
MSS '01 Proceedings of the Eighteenth IEEE Symposium on Mass Storage Systems and Technologies
The real-time behavior of dynamic memory management in C++
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
ISPASS '03 Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software
Simulation of high-performance memory allocators
Microprocessors & Microsystems
| Hi-index | 0.00 |
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. Bad memory management causes severe waste of memory, several times that actually needed, in programs. It can also cause degradation in performance. Many widely used allocators waste memory and/or CPU time. Since computer memory is an expensive and limited resource its efficient utilization is necessary. There cannot exist a memory allocator that will deliver best performance and least memory consumption for all programs and therefore easily tunable allocators are required. General purpose allocators that come with operating systems give less than optimal performance or memory consumption. An allocator with a few tunable parameters can be tailored to a program's needs for optimal performance and memory consumption. Our tunable hybrid allocator design shows 11-54% better performance and nearly equal memory consumption when compared to the well known Doug Lea allocator in seven benchmark programs.