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

diff --git a/todo b/todo
index da53a45..34efcf4 100644
--- a/todo
+++ b/todo
@@ -1,25 +1,18 @@
-+ fix makefile to compute dependency info as a side-effect of compilation (-MF)
-+ support integer keys for ht
-+ optimize tracing code, still too much overhead
-+ use NULL instead of a sentinal node in skiplist and list
-+ make the interfaces for all data structures consistent 
-+ make list and skiplist use string keys
-+ optimize integer keys
-+ ht_print()
-+ iterators
-
 memory manangement
 ------------------
-- make rcu yield when its buffer gets full instead of throwing an assert
-- alternate memory reclamation schemes, hazard pointers and/or reference count
-- verify key management in list, skiplist, and hashtable
+- 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
 
-quaility
---------
+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, list and skiplist
-- validate arguments in interface functions
+- characterize the performance of hashtable vs. skiplist vs. list
+- validate function arguments in interface functions
 - document usage of the library
 - document algorithms
 
@@ -29,11 +22,8 @@ optimization
 - 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 keys in the list/skiplist nodes
+- experiment with embedding the nstring keys in the list/skiplist nodes
 
 features
 --------
-- 32 bit version of hashtable
-- verify list and skiplist work on 32 bit platforms
-- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something else)
-- seperate nbd_malloc/nbd_free into general purpose malloc/free replacement
+- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something other than 0)