X-Git-Url: https://pd.if.org/git/?p=nbds;a=blobdiff_plain;f=todo;h=34efcf4c7c70de13675535f797dc3e8a1384a265;hp=956736ae4a078732fba04ae085fd63787c218cb4;hb=0f6e9afb06b03647c4c5f2499ddab12f42b4340e;hpb=025017478bb385da88a6b185849c8bcffeb2e2aa

diff --git a/todo b/todo
index 956736a..34efcf4 100644
--- a/todo
+++ b/todo
@@ -1,10 +1,29 @@
-- make rcu wait when its buffer gets full, instead of crashing
-- fix makefile to compute dependency info as a side-effect of compilation (-MF)
+memory manangement
+------------------
+- allow threads to dynamically enter and exit rcu's token passing ring
+- augment rcu with heartbeat manager to kill and recover from stalled threads
+- make rcu try yielding when its buffer gets full
+- alternate memory reclamation schemes: hazard pointers and/or reference counting
+- seperate nbd_malloc/nbd_free into general purpose malloc/free replacement
+
+quality
+-------
+- verify the key memory management in list, skiplist, and hashtable
+- transaction tests
+- port perf tests from lib-high-scale
+- characterize the performance of hashtable vs. skiplist vs. list
+- validate function arguments in interface functions
+- document usage of the library
+- document algorithms
+
+optimization
+------------
 - investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys 
-- test ht
-+ optimize tracing code, still too much overhead
-+ use NULL instead of a sentinal node in skiplist and list
-- make interfaces for all data structures consistent 
-+ make list and skiplist use string keys
-+ optimize integer keys
-- sl_free() ll_free() ht_print()
+- shortcut from write-set to entries/nodes
+- use a shared scan for write-set validation, similar to ht copy logic
+- experiment with the performance impact of not passing the hash between functions in ht
+- experiment with embedding the nstring keys in the list/skiplist nodes
+
+features
+--------
+- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something other than 0)