X-Git-Url: https://pd.if.org/git/?p=nbds;a=blobdiff_plain;f=todo;h=67b75dc6ac0eebafb42b1c188cd9eec75ca18acf;hp=dbdab1289ed2788b38ad7122a51b8ea0905f922a;hb=HEAD;hpb=a03cf3b0c40e6c3b8b4877b49a64288cb3fcb919

diff --git a/todo b/todo
index dbdab12..67b75dc 100644
--- a/todo
+++ b/todo
@@ -1,40 +1,31 @@
-+ 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
+memory reclamation
 ------------------
-- allow threads to dynamically enter and exit rcu's token ring
-- augment rcu with heartbeat manager to kill stalled threads
+- 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
+- use alternate memory reclamation schemes: hazard pointers and/or reference counting
 
 quality
 -------
-- verify the key memory management in list, skiplist, and hashtable
+- 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 vs. skiplist vs. list
 - validate function arguments in interface functions
-- document usage of the library
+- 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
+- lower skiplist's high_water when the actual number of levels in use drops
+- non-power-of 2 sized hashtables for improved memory usage
+- mem2
 
 features
 --------
 - 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