From: Hannes Frederic Sowa <han...@stressinduktion.org> Date: Wed, 30 Nov 2016 14:12:48 +0100
> David, one question: do you remember if you measured with linked lists > at that time or also with arrays. I actually would expect small arrays > that entirely fit into cachelines to be actually faster than our current > approach, which also walks a linked list, probably the best algorithm to > trash cache lines. I ask because I currently prefer this approach more > than having large allocations in the O(1) case because of easier code > and easier management. I did not try this and I do agree with you that for extremely small table sizes a list or array would perform better because of the cache behavior.