What sort of allocation rates can servers handle?

Re:What sort of allocation rates can servers handle? by wahern on Monday November 03, 2014 @06:40PM (#8554298)

There's no other way to implementation a lock-less compacting (i.e. copying) collector than by using transactional memory algorithms. Period.

I've never used C4, and I don't even program in Java. But I have personally studied and implemented transactional memory algorithms, and C4 fits perfectly into that mold. In fact, what originally made me interested in transactional memory was figuring out how C4 worked.

And I did figure it out. I figured it out even before they published their 2011 paper, which I just discovered. And unsurprisingly everything in there is precisely as I predicted. It couldn't have been otherwise once you understand the fundamentals.

[ Parent | on HN ]

Re:What sort of allocation rates can servers handle? by giltene on Tuesday November 04, 2014 @03:16AM (#8555561)

Um. There are 30 years worth of academic publications covering concurrent compacting collectors that don't need or use transactional memory, and are implementable on commodity hardware with no emulation or specialized instructions. C4 is just one of many examples of this fact. Sure, C4 does some cool new things, but trying to move or copy memory transactionally isn't one of them.

Whatever it is you think you figured out about how C4 works seems to be wrong. You may want to re-examine those fundamentals.

[ Parent | on HN ]

Re:What sort of allocation rates can servers handle? by mjpt777 on Tuesday November 04, 2014 @02:57AM (#8555521)

I asked the question if this is based on conjecture or experimental evidence. I'm happy to base my view on experimental evidence from my own research and testing.

[ Parent | on HN ]