Groups > comp.programming.threads > #2485

Re: My scalable MLock algorithm

From	aminer <aminer@toto.net>
Newsgroups	comp.programming.threads, comp.programming
Subject	Re: My scalable MLock algorithm
Date	2014-06-11 04:27 -0700
Organization	albasani.net
Message-ID	<lnae3o$d9n$1@news.albasani.net> (permalink)
References	<lnaaa0$55a$1@news.albasani.net> <lnaam7$55a$4@news.albasani.net>

Cross-posted to 2 groups.

Show all headers | View raw

An Pham wrote:
 >It is not a queue. It is a stack (last in first out)


The following part inside the Enter() method:

"long(prev) := LockedExchange(long(m_head), long(fcount1));
prev.next := fcount1;``


Is the waitfree push() , and the waitfree pop() is inside the Leave() 
method.


This is a waitfree FIFO queue.

And my scalable MLock is waitfree and FIFO fair.



Thank you,
Amine Moulay Ramdane.

Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

My scalable MLock algorithm aminer <aminer@toto.net> - 2014-06-11 03:22 -0700
  Re: My scalable MLock algorithm aminer <aminer@toto.net> - 2014-06-11 03:29 -0700
    Re: My scalable MLock algorithm aminer <aminer@toto.net> - 2014-06-11 04:27 -0700

csiph-web