-- make rcu yield when its buffer gets full instead of throwing an assert
-- alternate memory reclamation schemes, hazard pointers and/or reference count
-- investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys
-- document usage
-- document algorithms
-- port tests from lib-high-scale
-- 32 bit version of hashtable
-- verify list and skiplist work on 32 bit platforms
++ 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