The Memory Fragmentation Problem: Solved? (1997)
Cached
Download Links
- [www.cs.amherst.edu]
- [ftp.dcs.gla.ac.uk]
- [grothoff.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In International Symposium on Memory Management |
| Citations: | 60 - 1 self |
BibTeX
@INPROCEEDINGS{Johnstone97thememory,
author = {Mark S. Johnstone and Paul R. Wilson},
title = {The Memory Fragmentation Problem: Solved?},
booktitle = {In International Symposium on Memory Management},
year = {1997},
pages = {26--36},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Memory allocation has been an active area of research. A large number of algorithms have been proposed which were at least partly motivated by the belief that fragmentation can be a severe problem for some programs. Other algorithms have been proposed with the emphasis on performance rather than fragmentation. In this paper, we show that some well-known memory allocation algorithms, which can be implemented very efficiently, have essentially zero fragmentation for a wide variety of programs.
