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 - use alternate memory reclamation schemes: hazard pointers and/or reference counting
10 - verify the memory management of keys in list, skiplist, and hashtable
12 - port perf tests from lib-high-scale
13 - characterize the performance of hashtable vs. skiplist vs. list
14 - validate function arguments in interface functions
20 - investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys
21 - txn write after write can just update the old update record instead of pushing a new one
22 - use a shared scan for write-set validation in txn, similar to ht copy logic
23 - experiment with the performance impact of not passing the hash between functions in ht
24 - experiment with embedding the nstring keys in the list/skiplist nodes
28 - allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something other than 0)
29 - read-committed type transactions
30 - recycle free regions across size-classes and between threads