3 - allow threads to dynamically enter and exit rcu's token passing ring
4 - augment rcu with heartbeat manager to kill and recover from stalled threads
5 - make rcu try yielding when its buffer gets full
6 - alternate memory reclamation schemes: hazard pointers and/or reference counting
7 - seperate nbd_malloc/nbd_free into general purpose malloc/free replacement
11 - verify the key memory management in list, skiplist, and hashtable
13 - port perf tests from lib-high-scale
14 - characterize the performance of hashtable vs. skiplist vs. list
15 - validate function arguments in interface functions
16 - document usage of the library
21 - investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys
22 - shortcut from write-set to entries/nodes
23 - use a shared scan for write-set validation, similar to ht copy logic
24 - experiment with the performance impact of not passing the hash between functions in ht
25 - experiment with embedding the nstring keys in the list/skiplist nodes
29 - allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something other than 0)