About :: TODO :: Blog :: RSS :: Old blog :: Projects :: GIT :: Gallery :: Notes

Tue, 25 Jul 2006

Network tree allocator.


I've started stress tests for AVL-tree implementation, it passed about several hundreds of millions search/insert operations (splitted into 100k and 1 million chunks) for pseudo random values, so it seems that tree has been implemented correctly. I leave stress test for about 10 hours to complete this developement stage.

Implementation does not use dynamic allocation of the nodes, the are obtained from preallocated pool. Ten millions search/insert operations take about 4.5 seconds on my AMD64 Athlon 3500+ machine.

/devel/networking/nta :: Link / Comments ()