X-Git-Url: https://pd.if.org/git/?p=nbds;a=blobdiff_plain;f=todo;h=ad68a8e294aecdc248d75c90f2c65c51f3986abe;hp=66ed49c7e1fbf868c3c01534cd1551d7aca606e3;hb=86fd9c8abfbacea2902b4fe42a8a4664b2a531cf;hpb=c7c053b290f15b7c8ba4f7327ead5a6fe836ec80

diff --git a/todo b/todo
index 66ed49c..ad68a8e 100644
--- a/todo
+++ b/todo
@@ -1,38 +1,32 @@
-+ 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
-+ 32 bit support
-
-memory manangement
+memory reclamation
 ------------------
-- make rcu yield when its buffer gets full instead of throwing an assert
-- alternate memory reclamation schemes: hazard pointers and/or reference counting
-- verify the key management in list, skiplist, and hashtable
-- seperate nbd_malloc/nbd_free into general purpose malloc/free replacement
+- 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
+- use alternate memory reclamation schemes: hazard pointers and/or reference counting
 
 quality
 -------
+- verify the memory management of keys 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
-- document usage of the library
+- characterize the performance of hashtable vs. skiplist vs. list
+- validate function arguments in interface functions
+- document usage
 - document algorithms
 
 optimization
 ------------
 - investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys 
-- shortcut from write-set to entries/nodes
-- use a shared scan for write-set validation, similar to ht copy logic
+- txn write after write can just update the old update record instead of pushing a new one
+- use a shared scan for write-set validation in txn, 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
 --------
-- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something else)
+- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something other than 0)
+- read-committed type transactions
+- recycle free regions across size-classes and between threads
+
+