I've quickly ported Go version and run tests comparing to DCAS: Lock-free Stack using Double width CAS and Packed/Tagged pointer (based on Go) <https://gist.github.com/inspirit/f044cabb9c5000a554fc>
obviously version with pointer hacking is faster. u can see my results on Gist page On Saturday, June 20, 2015 at 7:47:24 PM UTC+2, Dmitry Vyukov wrote: > > On Sat, Jun 20, 2015 at 6:56 PM, Eugene Zatepyakin <zatep...@gmail.com > <javascript:>> wrote: > > Hi Dmitry, > > > > thanx for your explanation. > > i did quick tests on iOS platform and it seems to support DwCAS (that > was > > quicks runs and i'm not 100% sure) > > > > i also read in some articles that it is enough to only increment counter > > during "pop" operation does it sounds valid? > > > Yes, it is enough to ensure that a node cannot be reinserted with the > same counter. > You can also use per-node counters, rather than single global counter. > -- --- You received this message because you are subscribed to the Google Groups "Scalable Synchronization Algorithms" group. To unsubscribe from this group and stop receiving emails from it, send an email to lock-free+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/lock-free/86eb37c2-4348-44bd-aebd-03ac52f075d9%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
