Kurt Stephens

I’m planning a new release of TM v.04, originally outlined here: http://kurtstephens.com/research/tredmill

New documentation is located at:

http://kurtstephens.com/pub/tredmill/current/doc/html/index.html

Code to follow shortly.

Interesting paper on weak data structures and implementations:

http://www.haible.de/bruno/papers/cs/weak/WeakDatastructures-writeup.htm...

See also:

http://www.memorymanagement.org/

Introduction

TM is a real-time, non-relocating, conservative, allocator using type- and color-segregated lists, based on Henry Baker’s “Treadmill” allocator. The source code for TM is located at http://kurtstephens.com/pub/tredmill.

TM interleaves marking, scanning and sweeping during each mutator’s call to tm_alloc().

TM attempts to limit the amount of work in the collector to avoid stopping the world for long periods of time. It does not require a separate thread for the collector as all collection activities are interleaved with allocation.

Full documentation is located at: http://kurtstephens.com/pub/tredmill/current/doc/html/index.html