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

diff --git a/todo b/todo
index d275543..34efcf4 100644
--- a/todo
+++ b/todo
@@ -1,23 +1,14 @@
-+ fix makefile to compute dependency lists 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
-+ 32 bit x86 support
-
 memory manangement
 ------------------
-- make rcu yield when its buffer gets full instead of throwing an assert
+- 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 management in list, skiplist, and hashtable
+- 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
@@ -31,7 +22,7 @@ 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
 --------