Download:
|
by Benjamin Zorn, Benjamin Zorn, Benjamin Zorn, Dirk Grunwald, Dirk Grunwald, Dirk Grunwald
ACM Transactions on Modeling and Computer Simulation
ftp://ftp.cs.colorado.edu/pub/cs/techreports/zorn/CU-CS-603-92.ps.Z
Add To MetaCart
Abstract:
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. We evaluate and compare models of the memory allocation behavior in actual programs and investigate how these models can be used to explore the performance of memory management algorithms. These models, if accurate enough, provide an attractive alternative to algorithm evaluation based on trace-driven simulation using actual traces. We explore a range of models of increasing complexity including models that have been used by other researchers. Based on our analysis, we draw three important conclusions. First, a very simple model, which generates a uniform distribution around the mean of observed values, is often quite accurate. Second, two new models we propose show greater accuracy than those previously described in the literature. Finally, none of the models investigated appear adequate for generating an operating system workload. 1
Citations
|
537
|
Cache Memories
– Smith
- 1982
|
|
387
|
A study of replacement algorithms for virtual storage computers. IBMSystems Journal
– Belady
- 1966
|
|
231
|
Optimally profiling and tracing programs
– Ball, Larus
- 1360
|
|
194
|
Evaluation techniques for storage hierarchies
– Mattson, Gecsei, et al.
|
|
85
|
Abstract Execution: A Technique for Efficiently Tracing Programs
– Larus
- 1990
|
|
51
|
Caching considerations for generational garbage collection
– Wilson, Lam, et al.
- 1992
|
|
37
|
The P2 Algorithm for Dynamic Calculation of Quantiles and Histograms without Storing Observations
– Jain, Chlamtac
- 1985
|
|
33
|
The effect of garbage collection on cache performance
– Zorn
- 1991
|
|
24
|
Empirical measurements of six allocation-intensive C programs
– Zorn, Grunwald
- 1992
|
|
16
|
Fundamental Algorithms, volume 1 of The Art of
– Knuth
- 1973
|
|
11
|
Schatzo . Analysis of free-storage algorithms
– Margolin, Parmelee, et al.
- 1971
|
|
10
|
Efficient implementation of the first-fit strategy for dynamic storage allocation
– Brent
- 1989
|
|
8
|
The Art of Computer Systems Performance Evaluation
– Jain
- 1991
|
|
7
|
Description of a very fast storage allocator. Documentation of 4.2 BSD Unix malloc implementation
– Kingsley
- 1982
|
|
7
|
and Kiem-Phong Vo. In search of a better malloc
– Korn
- 1985
|
|
7
|
Adaptive exact-fit storage management
– Oldehoeft, Allan
- 1985
|
|
5
|
Analysis of free-storage algorithms---revisited
– Bozman, Buco, et al.
- 1984
|
|
3
|
The software lookasize buffer reduces search overhead with linked lists
– Bozman
- 1984
|