Adaptive exact-fit storage management
Communications of the ACM
Efficient implementation of the first-fit strategy for dynamic storage allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract execution: a technique for efficiently tracing programs
Software—Practice & Experience
Segment sizes and liftetimes in Algol 60 programs
Communications of the ACM
Communications of the ACM
Data Structure Techniques
Dynamic storage allocation techniques.
Dynamic storage allocation techniques.
Improving the cache locality of memory allocation
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Using lifetime predictors to improve memory allocation performance
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Evaluating models of memory allocation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Garbage collection using a dynamic threatening boundary
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
A High-Performance Memory Allocator for Object-Oriented Systems
IEEE Transactions on Computers
A Study of the Allocation Behavior of the SPECjvm98 Java Benchmark
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
An Architecture for Reusable Libraries
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
malloc() performance in a multithreaded Linux environment
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Memory management thread for heap allocation intensive sequential applications
Proceedings of the 10th workshop on MEmory performance: DEaling with Applications, systems and architecture
A study of best-fit memory allocators
Computer Languages, Systems and Structures
ACDC: towards a universal mutator for benchmarking heap management systems
Proceedings of the 2013 international symposium on memory management
| Hi-index | 0.00 |
Dynamic memory management is an important part of a large class of computer programs and high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. This paper presents empirical data from a collection of six allocation-intensive C programs. Extensive statistics about the allocation behavior of the programs measured, including the distributions of object sizes, lifetimes, and interarrival times, are presented. This data is valuable for the following reasons: first, the data from these programs can be used to design high-performance algorithms for dynamic memory management. Second, these programs can be used as a benchmark test suite for evaluating and comparing the performance of different dynamic memory management algorithms. Finally, the data presented gives readers greater insight into the storage allocation patterns of a broad range of programs. The data presented in this paper is an abbreviated version of more extensive statistics that are publically available on the internet.