638
edits
User:Jorend/Deterministic hash tables: Difference between revisions
Jump to navigation
Jump to search
User:Jorend/Deterministic hash tables (view source)
Revision as of 01:44, 23 February 2012
, 23 February 2012→Results
| Line 46: | Line 46: | ||
[[Image:jorendorff-dht-figure-1.png]] | [[Image:jorendorff-dht-figure-1.png]] | ||
CloseTable is more memory-efficient than DenseTable, because the latter is | CloseTable is much more memory-efficient than DenseTable, because the latter is tuned for fast lookups at all costs. | ||
[[Image:jorendorff-dht-figure-2.png]] | [[Image:jorendorff-dht-figure-2.png]] | ||
| Line 55: | Line 55: | ||
This measures the time required to fill a table to about 100 entries, repeatedly. | This measures the time required to fill a table to about 100 entries, repeatedly. | ||
This graph and the following ones show speed, so '''higher is better'''. | |||
Ideally all these graphs would show three straight horizontal lines, indicating that all three implementations scale beautifully to large work loads. And indeed this seems to be the case, mostly. | |||
[[Image:jorendorff-dht-InsertLargeTest-speed.png]] | [[Image:jorendorff-dht-InsertLargeTest-speed.png]] | ||