Garbage Collection: Algorithms for Automatic Dynamic Memory Management Rafael D Lins, Richard Jones
Publisher: Wiley

Dynamic memory allocation tends to be nondeterministic; the time taken to allocate memory may not be predictable and the memory pool may become fragmented, resulting in unexpected allocation failures. The access of automatic variables is a very fast assisted by hardware, so there is no loss of efficiency there. This defragmentation may occur when a memory allocation fails or there may be a periodic garbage collection process that is run. There is no actual allocation or deallocation going on: the space in the automatic memory (AKA "on the stack") is allocated by some compile-time bookkeeping around the stack pointer. €…garbage collection (GC) is a form of automatic memory management. The stack is normally located . In this session the Automatic variables (and function parameters) are usually stored on the stack. Memory Management: Algorithms and Implementation in C/C++ presents several concrete implementation of garbage collection and explicit memory management algorithms. Dynamic memory allocation (Java-style) is done with malloc / calloc / realloc in C. Automatic reference counting and disposal of objects being proposed would make programming easier in some situations, and make ARC-enabled objects more compatible with interfaces and dynamic arrays. This brings me to one of the more controversial features of high level languages: garbage collection. But there is no need to I am not too familiar with the technical details of garbage collection, but I would like to express a few preliminary thoughts of a general nature about manual versus automatic memory management. IMO this is almost a no-brainer. These are not garbage collected - you need to explicitly free every pointer that you allocated.