Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #2481
| From | aminer <aminer@toto.net> |
|---|---|
| Newsgroups | comp.programming.threads, comp.programming |
| Subject | Re: My scalable MLock algorithm |
| Date | 2014-06-11 03:29 -0700 |
| Organization | albasani.net |
| Message-ID | <lnaam7$55a$4@news.albasani.net> (permalink) |
| References | <lnaaa0$55a$1@news.albasani.net> |
Cross-posted to 2 groups.
On 6/11/2014 3:22 AM, aminer wrote: > Look that i am using this: > > long(prev) := LockedExchange(long(m_head), long(fcount1)); > > > this is a waitfree queue and the push() and the pop() inside my > scalable MLock algorithm are waitfree... I mean this is a waitfree FIFO queue. Thank you, Amine Moulay Ramdane.
Back to comp.programming.threads | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll 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