Memory allocation with lazy fits (2000) [2 citations — 1 self]
Download:
|
|
by Yoo C. Chung, Soo-mook Moon
ACM SIGPLAN Notices , Proceedings of the 2nd international symposium on Memory management ISMM '00, ACM Press, School of Electrical Engineering Seoul National University, October 2000, Volume 36 Issue
http://laplace.snu.ac.kr/~wacko/papers/lazy-fit.ps.gz
Add To MetaCart
Abstract:
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is used as the primary allocation method and where conventional fits such as best fit or first fit are used as backup. Some experimental results showing how lazy segregated first fit performs are shown, and shows that the approach has the potential to be useful in actual systems. 1
Citations
| 154 | Dynamic storage allocation: A survey and critical review – Wilson, Johnstone, et al. - 1995 |
| 79 | The measured cost of conservative garbage collection – Zorn - 1992 |
| 60 | The memory fragmentation problem: Solved – Johnstone, Wilson - 1998 |
| 16 | Fundamental Algorithms, volume 1 of The Art of – Knuth - 1973 |
| 7 | Compiler support to customize the mark and sweep algorithm – Colnet, Coucaud, et al. - 1998 |
| 5 | Memory allocation policies reconsidered – Wilson, Johnstone, et al. - 1995 |
| 4 | A memory allocator. Available at http://g.oswego.edu/dl/ html/malloc.html – Lea |
| 3 | Allocation with increments in a non-moving collector. Available at http://pallas.snu.ac.kr/~chungyc/papers/fast-alloc.ps – Chung |
| 2 | Soo-Mook Moon, and Kemal Ebcioglu. Memory management in the LaTTe Java virtual machine – Chung, Lee - 2000 |
| 1 | CSRI University of Toronto malloc. Available at ftp://ftp.cs. toronto.edu/pub/moraes/malloc.tar.gz – Moraes |
