[Libcds-user] Memory Management Methods

[Lucas L. <luc...@gm...>]

I was re-reading the paper from Michael Maged, "High Performance Dynamic
Lock-Free Hash Tables
and List-Based Sets" which seems to be used as the source for the
implementation of hash structures in libcds.

The paper claims that the algorithm proposed is compatible with different
memory management methods. It also points that freelists and safe memory
reclamation are the only methods that are not extremely inefficient,
blocking or dependent on special system support. The libcds seems to use a
garbage collection memory management method (probably to avoid the ABA
problem). Is there a reason not to use freelists or SMR? Is there an
alternative? Is the garbage collection environment so inefficient as it
says?

I would like some clarification in case I am getting it all wrong. Thank
you advance for the attention :)


-- 
Lucas Lersch