GitHub - kstephens/tredmill: A real-time, non-relocating, conservative, Treadmill allocator.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 92 Commits
doc		doc
Makefile		Makefile
PKG		PKG
README		README
alloc.c		alloc.c
alloc_log.gp		alloc_log.gp
barrier.c		barrier.c
barrier.h		barrier.h
block.c		block.c
block.h		block.h
color.c		color.c
color.h		color.h
config.h		config.h
debug.c		debug.c
debug.h		debug.h
init.c		init.c
internal.c		internal.c
internal.h		internal.h
list.h		list.h
log.c		log.c
log.h		log.h
malloc.c		malloc.c
mark.c		mark.c
mark.h		mark.h
node.h		node.h
node_color.h		node_color.h
os.c		os.c
os.h		os.h
page.h		page.h
phase.c		phase.c
phase.h		phase.h
ptr.h		ptr.h
root.c		root.c
root.h		root.h
stats.c		stats.c
stats.h		stats.h
tm.c		tm.c
tm.h		tm.h
tm_data.c		tm_data.c
tm_data.h		tm_data.h
tmtest.c		tmtest.c
tmtest.gdb		tmtest.gdb
tread.c		tread.c
tread.h		tread.h
tread_inline.h		tread_inline.h
tread_test.c		tread_test.c
type.c		type.c
type.h		type.h
user.c		user.c
wb.c		wb.c
wb.h		wb.h

Repository files navigation

$Id: README,v 1.6 2008-01-15 05:21:03 stephens Exp $

	Introduction

This is a real-time, non-relocating, conservative, Treadmill allocator.

TM interleaves marking, scanning and sweeping during each call to tm_malloc().

TM attempts to limit the amount of scanning, marking and collecting
during each call to tm_alloc() to avoid stopping the world for long
periods of time.

      	For More Information

See http://kurtstephens.com/research/tredmill


    To Do

* Implement allocations larger than tm_block_SIZE.
* Implement aligned allocations using a page-indexed bit vector.
** Flag a bit for the beginning page of the aligned block.
** Use a hash table to map the address of the aligned block to a tm_block containing its own tm_type.