concurrency

Daniel Lewis murpsoft at hotmail.com
Mon Feb 4 03:50:27 PST 2008


Sean Kelly Wrote:
> This is basically how futures work.  It's a pretty useful approach.

Agreed.  Steve Dekorte has been working with them for a long time and integrated them into his iolanguage.  He found he could regularly get comparable performance to Apache even in a pure OO framework (even Number!?) just 'cause his parallelization was better.

I personally believe the best way though is to take advantage of lock instructions for *allocation* of memory.  Once memory is allocated, it's "yours" to do with as you please.  I haven't looked at this for a few months but I remember seeing an algorithm that did first-through concurrency loop-locks for malloc and free and had practically no overhead ever.

Regards,
Dan



More information about the Digitalmars-d mailing list