Dynamic memory allocation and garbage collection

被引：0

作者：

Boehm, Hans-J. ^{[1
]}

机构：

[1] Xerox's Palo Alto Research Cent

来源：

Computers in physics | 1995年 / 9卷 / 03期

关键词：

Algorithms - C (programming language) - Computer systems programming - Concurrency control - Data structures - LISP (programming language) - Natural sciences computing - Optimization - Performance - Program compilers - Subroutines - Synchronization;

D O I：

10.1063/1.4823407

中图分类号：

学科分类号：

摘要：

Dynamic allocation of memory is required in many algorithms while the program is running. Many numerical programs will need to allocate sections of memory whose size or number depends on the particular input to the program. On the other hand, the process of reclaiming and reusing useless memory is called 'garbage collection'. Garbage collectors make it relatively easy to work with dynamically allocated memory and encourage reasonably behaved application programs.

引用

页码：297 / 303