http://davedolan.com/blog/2007/10/03/lock-free-coding-addendum/ Website not included. Fri, 21 Nov 2008 02:16:24 +0000 http://wordpress.org/?v=2.6.3 http://davedolan.com/blog/2007/10/03/lock-free-coding-addendum/#comment-7252 Dave Fri, 19 Oct 2007 13:38:21 +0000 http://davedolan.com/blog/2007/10/03/lock-free-coding-addendum/#comment-7252 found something, I don't know how I missed it before... http://www.boyet.com/Articles/LockFreeLimitedPriorityQ.html found something, I don’t know how I missed it before…
http://www.boyet.com/Articles/LockFreeLimitedPriorityQ.html

]]> http://davedolan.com/blog/2007/10/03/lock-free-coding-addendum/#comment-7251 Dave Fri, 19 Oct 2007 13:11:46 +0000 http://davedolan.com/blog/2007/10/03/lock-free-coding-addendum/#comment-7251 Please do enlighten me of which algorithms you speak, because so far all I can find are things involving System.Collections and SynchRoot, or custom version of it that are like that.. which has till now been very disappointing. Is there a library somewhere on this? (Sorry about making you hit a captcha to post here, I got spammed ridiculously before I did that though.) Please do enlighten me of which algorithms you speak, because so far all I can find are things involving System.Collections and SynchRoot, or custom version of it that are like that.. which has till now been very disappointing. Is there a library somewhere on this? (Sorry about making you hit a captcha to post here, I got spammed ridiculously before I did that though.)

]]> http://davedolan.com/blog/2007/10/03/lock-free-coding-addendum/#comment-7234 passenger Fri, 19 Oct 2007 07:48:05 +0000 http://davedolan.com/blog/2007/10/03/lock-free-coding-addendum/#comment-7234 In C# you can create a thread-safe collection by wrapping around your queue with Queue.Synchronised. What it does is creating a lock around the Enqueue/Dequeue operations so that only one thread a time can perform these operations on the same instance of the queue. There are scalability issues: if a server has X threads accessing the queue the lock will cause a performance drop due to serialization of execution. That\'s where lock-free stack, queue, hash etc algorithms help. They allow threads to enter the same dequeue/enqueue operation simultaneously and progress in parallel operation down to a single CAS (compare-and-swap) primitive which is called Interlocked.CompareExchange in C#. In C# you can create a thread-safe collection by wrapping around your queue with Queue.Synchronised. What it does is creating a lock around the Enqueue/Dequeue operations so that only one thread a time can perform these operations on the same instance of the queue. There are scalability issues: if a server has X threads accessing the queue the lock will cause a performance drop due to serialization of execution. That\’s where lock-free stack, queue, hash etc algorithms help. They allow threads to enter the same dequeue/enqueue operation simultaneously and progress in parallel operation down to a single CAS (compare-and-swap) primitive which is called Interlocked.CompareExchange in C#.

]]>