Adaptive exact-fit storage management
Communications of the ACM
The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations
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
Empirical measurements of six allocation-intensive C programs
ACM SIGPLAN Notices
Optimally profiling and tracing programs
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improving the cache locality of memory allocation
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
ACM Computing Surveys (CSUR)
The software lookaside buffler reduces search overhead with linked lists
Communications of the ACM
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Database Access Characterization for Buffer Hit Prediction
Proceedings of the Ninth International Conference on Data Engineering
High-level dynamic memory management for object-oriented real-time systems
ACM SIGPLAN OOPS Messenger - Special issue: object-oriented real-time systems
Memory allocation for long-running server applications
Proceedings of the 1st international symposium on Memory management
A Study of the Allocation Behavior of the SPECjvm98 Java Benchmark
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
Estimating internal memory fragmentation for Java programs
Journal of Systems and Software
An algorithm with constant execution time for dynamic storage allocation
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
An efficient dynamic memory allocator for sensor operating systems
Proceedings of the 2007 ACM symposium on Applied computing
malloc() performance in a multithreaded Linux environment
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Implementation of a constant-time dynamic storage allocator
Software—Practice & Experience
A constant-time dynamic storage allocator for real-time systems
Real-Time Systems
Computer storage fragmentation: pioneering work of brian randell
Dependable and Historic Computing
A study of best-fit memory allocators
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for dynamic memory management have been and will continue to be of considerable interest. The goal of this research is to explore the size and accuracy of synthetic models of program allocation behavior. These models, if accurate enough, proved an attractive alternative to algorithm evaluation based on trace-driven simulation using actual traces. Based on our analysis, we conclude that even relatively simple synthetic models can effectively emulate the allocation behavior of well-behaved programs. However, even the most complex models we investigate can only roughly approximate the behavior of more complex programs and/or allocation policies. While synthetic models have been used to evaluate the performance of dynamic memory management algorithms, our results show that these models can be inaccurate and must be used with care. Given current trends toward more complex applications and allocation algorithms, the synthetic models we investigate are likely to be even less accurate in the future.