X-Git-Url: https://pd.if.org/git/?p=nbds;a=blobdiff_plain;f=todo;h=d2755436647f10e7528b00db446e79d27a8b581b;hp=807a31a35e9d2131743fe711675ed4a6f6bd046a;hb=e592519ef19f890e551c27f47ef8b773bb4860da;hpb=329b5ab58cde015f4faec1879d3106f635294dd6 diff --git a/todo b/todo index 807a31a..d275543 100644 --- a/todo +++ b/todo @@ -1,4 +1,4 @@ -+ fix makefile to compute dependency info as a side-effect of compilation (-MF) ++ fix makefile to compute dependency lists 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 @@ -7,20 +7,32 @@ + optimize integer keys + ht_print() + iterators ++ 32 bit x86 support + +memory manangement +------------------ - 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 +- 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 management in list, skiplist, and hashtable - transaction tests -- validate the arguments to interface functions +- 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 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 -- characterize the performance of hashtable, list and skiplist - experiment with the performance impact of not passing the hash between functions in ht - experiment with embedding the keys in the list/skiplist nodes -- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something else) -- see if it's possible to rename nbd_malloc to malloc + +features +-------- +- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something other than 0)