On Sat, 30 Nov 2002, George Schlossnagle wrote:
> A little off-list discussion has sold me on the linked list
> implementation. Seems very fast and very simple.
O(1) operations are hard to beat. Note that free lists are
not primarily about speed, they are also an extremely helpful
tool in the fight against memory fragmentation.
That said, IRCG has been using single-linked lists for its
free lists (3 or 4 data structures) since its inception. I'm
moving IRCG right now to a multi-process model and still need
to evaluate whether a central free list (based in shared
memory and protected by a semaphore) actually works that
well. For example, lock contention issues could affect the
performance. Some systems in the kernel world use per-node
(=CPU) locks which might prove to be a necessary step for
applications as well.
- Sascha
--
PHP Development Mailing List <http://www.php.net/>
To unsubscribe, visit: http://www.php.net/unsub.php
