X-Git-Url: https://pd.if.org/git/?p=nbds;a=blobdiff_plain;f=todo;h=eba0d337f7495f16351f9d143b8d15587b4cd925;hp=ff93413f6a9c8e9c58271e8101fcb26277e378e6;hb=973c2b13fe82d6ebd030cd58869fa237b1fe5370;hpb=4a7804bd08c790fc3c4233312e4b485c3302fe02

diff --git a/todo b/todo
index ff93413..eba0d33 100644
--- a/todo
+++ b/todo
@@ -1,7 +1,30 @@
-- make rcu wait when its buffer gets full, instead of crashing
-- fix makefile to compute dependency info as a side-effect of compilation (-MF)
-- investigate 16 byte CAS 
-    - ht can store GUIDs inline instead of pointers to actual keys 
-    - mem can keep tail pointers for free-lists and do O(1) appends
-- test ht
-- optimize tracing code, still too much overhead
+memory reclamation
+------------------
+- 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 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 
+- 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 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)
+- read-committed type transactions
+- recycle free regions across size-classes and between threads