Memory Management with Explicit Regions (1998)
Cached
Download Links
- [www.cs.berkeley.edu]
- [theory.stanford.edu]
- [berkeley.intel-research.net]
- [www.cs.stanford.edu]
- [cs.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 115 - 4 self |
BibTeX
@INPROCEEDINGS{Gay98memorymanagement,
author = {David Gay and Alex Aiken},
title = {Memory Management with Explicit Regions},
booktitle = {},
year = {1998},
pages = {313--323}
}
Years of Citing Articles
OpenURL
Abstract
Much research has been devoted to studies of and algorithms for memory management based on garbage collection or explicit allocation and deallocation. An alternative approach, region-based memory management, has been known for decades, but has not been wellstudied. In a region-based system each allocation specifies a region, and memory is reclaimed by destroying a region, freeing all the storage allocated therein. We show that on a suite of allocation-intensive C programs, regions are competitive with malloc/free and sometimes substantially faster. We also show that regions support safe memory management with low overhead. Experience with our benchmarks suggests that modifying many existing programs to use regions is not difficult. 1 Introduction The two most popular memory management techniques are explicit allocation and deallocation, as in C's malloc/free, and various forms of garbagecollection [Wil92]. Both have well-known advantages and disadvantages, discussed further below. A t...







