port to Ubuntu 8.10 x86-64 w/ gcc 4.3.2

[nbds] / todo

diff --git a/todo b/todo
index b198f920596e2ecae48341924ad86d82fccaebcd..dbdab1289ed2788b38ad7122a51b8ea0905f922a 100644 (file)
--- a/todo
+++ b/todo
@@ -1,16 +1,40 @@
-- make rcu wait when its buffer gets full, instead of throwing an assert
-+ 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 
-- testing, testing, testing
++ fix makefile to compute dependency lists as a side-effect of compilation (-MF)
 + support integer keys for ht
-- validate arguments to interface functions
 + 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
-- characterize performance of data structures
-- experiment with the performance impact of not passing the hash between functions
-- experiment with embedding keys in the list/skiplist nodes
++ ht_print()
++ iterators
++ 32 bit x86 support
+
+memory manangement
+------------------
+- allow threads to dynamically enter and exit rcu's token ring
+- augment rcu with heartbeat manager to kill 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 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
+- validate function arguments in interface functions
+- document usage of the library
+- 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
+- experiment with the performance impact of not passing the hash between functions in ht
+- experiment with embedding the 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)