X-Git-Url: https://pd.if.org/git/?p=nbds;a=blobdiff_plain;f=todo;fp=todo;h=eba0d337f7495f16351f9d143b8d15587b4cd925;hp=34efcf4c7c70de13675535f797dc3e8a1384a265;hb=7d658a03f83e64690d0c71b4733dd3f9a2c60208;hpb=6b4f3ea4891b6c0e65dfd6d41f49aee2daa9e23d diff --git a/todo b/todo index 34efcf4..eba0d33 100644 --- a/todo +++ b/todo @@ -1,29 +1,30 @@ -memory manangement +memory reclamation ------------------ - 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 -- alternate memory reclamation schemes: hazard pointers and/or reference counting -- seperate nbd_malloc/nbd_free into general purpose malloc/free replacement +- use alternate memory reclamation schemes: hazard pointers and/or reference counting quality ------- -- verify the key memory management in list, skiplist, and hashtable +- 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 vs. skiplist vs. list - validate function arguments in interface functions -- document usage of the library +- 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 +- 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 nstring 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) +- read-committed type transactions +- recycle free regions across size-classes and between threads