Hans Boehm's page on the widely used Boehm-Demers-Weiser conservative garbage collector for C/C++. The Boehm-Demers-Weiser conservative garbage collector can be used as a garbage collecting replacement for C malloc or C++ new. It is also used by a number of programming language implementations that use C as intermediate code.

Article by Doug Lea about the design of his well-known "Lea" memory allocator.

Group at UMass that includes the Object Systems Laboratory, an active memory management research group.

Malloc replacement with debugging features.

20-21 July 2004 Canterbury, UK.

A debug heap for *nix. Captures buffer overwrites, memory leaks, stale pointers, most buffer underflows, and can provide statistics on block sizes.

A graphical utility that allows you to watch a program allocate and free dynamic memory blocks, increasing your understanding of memory.

Conference focused on research in management of dynamically allocated memory.

A higher performance replacement for malloc/new in C/C++ with multi-threaded/multi-processor support.

Papers from Paul Wilson's research group at the University of Texas at Austin.

Contains links to the papers presented at the 1997 OOPSLA Workshop on Garbage Collection and Memory Management.

A parallel and distributed extension of the BDW conservative collector.

A collection of papers on garbage collection, memory allocation, and the like from the OOPS Research Group at the University of Texas at Austin. Includes papers from the OOPSLA Workshops on Garbage Collection in 1990, 1991, and 1993.

Richard Jones wrote Garbage Collection: Algorithms for Automatic Dynamic Memory Management", the first English book concerned solely with garbage collection. Garbage collection page has an FAQ, and a large bibliography.

Conference focused on research in management of dynamically allocated memory. Ottawa, Canada.

A draft FAQ for the Garbage Collection mailing list. Contains a list of algorithms and techniques, related jargon, language interfaces, and challenging problems such as threading, distributed objects, persistency, and "uncooperative environments".

Hoard is a fast, scalable and memory-efficient malloc-replacement for multithreaded applications on multiprocessors. Widely-used, open-source.

A resource for programmers and computer scientists interested in memory management and garbage collection. Includes a fairly comprehensive bibliography of influential authors and papers in the field. Links to a glossary and a beginner's guide to the field.

Links to ptmalloc, a multithreaded-variant of Doug Lea's memory allocator.