On 2014-06-10 5:53 AM, Adam Sakareassen via Digitalmars-d wrote:
Hi,
Yes my little GC project is coming along. It allocates much faster in
multi threaded applications when all threads are competing for the lock.
D's current GC is very slow when there is contention for the GC-lock
which is acquired for every malloc. The other hidden lock usage is when
a dynamic array increases in size. A significant problem is that the
thread holding the lock might be pre-empted by the OS, causing all
threads to wait until it is running again. My lock-free allocator fixes
all this trouble.
Could you share a fork containing the source code to this? I'm very
curious as to how you've implemented it.
