-+ 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
-
-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 count
-- verify key management in list, skiplist, and hashtable
+- 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
-quaility
---------
+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
+- 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
+- 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
--------
-- 32 bit version of hashtable
-- verify list and skiplist work on 32 bit platforms
-- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something else)
-- seperate nbd_malloc/nbd_free into general purpose malloc/free replacement
+- 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
projects / nbds / blobdiff