work in progress

[nbds] / todo

diff --git a/todo b/todo
index eba0d337f7495f16351f9d143b8d15587b4cd925..67b75dc6ac0eebafb42b1c188cd9eec75ca18acf 100644 (file)
--- a/todo
+++ b/todo
@@ -9,8 +9,6 @@ quality
 -------
 - verify the memory management of keys in list, skiplist, and hashtable
 - transaction tests
 -------
 - 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
 - document algorithms
 - validate function arguments in interface functions
 - document usage
 - document algorithms


@@ -18,10 +16,13 @@ quality
 optimization
 ------------
 - investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys 
 optimization
 ------------
 - investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys 

-- write after write can just update the old update record instead of pushing a new one
+- txn 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
 - 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

+- lower skiplist's high_water when the actual number of levels in use drops
+- non-power-of 2 sized hashtables for improved memory usage
+- mem2

 
 features
 --------
 
 features
 --------