Groups > comp.programming.threads > #2299

Re: Finally my conclusion

From	"Chris M. Thomasson" <no@spam.invalid>
Newsgroups	comp.programming.threads, comp.programming, comp.arch
Subject	Re: Finally my conclusion
Date	2014-04-29 12:49 -0700
Organization	Aioe.org NNTP Server
Message-ID	<ljovo0$md4$1@speranza.aioe.org> (permalink)
References	<ljm0n9$7pu$1@news.albasani.net>

Cross-posted to 3 groups.

Show all headers | View raw

> "aminer"  wrote in message news:ljm0n9$7pu$1@news.albasani.net... [...]
> Other than that my two locks algorithm is starvation-free, so
> i think the Chriss Thomasson algorithm is not the best, my two locks
> algorithm is also very efficient and performant.
> [...]

Ummmmm...

wrt the "Two Lock" algorithm, well if it is _anything_ like:

https://www.cs.rochester.edu/research/synchronization/pseudocode/queues.html


PLEASE, stop and ponder... Yes the example I gave you is dynamic.

However, it is rather trivial to convert this into a bounded array
based system...


I already benched against this thing and other array based analogs of
the two lock algo. My queue completely decimates it. So much so that
I had to just stop it from executing because it took to long to even begin
to compare to the bakery algorithm I came up with.


Before you go completely _crazy_ animer, I tested it against an array
based analog of the two lock algo. The bakery algo still beats the living
sh%$ out of it.

BTW, Dmitry Vyukov's queue also __completely__ destroys any two lock
algorithm I throw at it.


So, what the %fu%cking^& hell are you rambling about?!

You have to learn how to calm down damn it!

And so do I...

;^/



BTW, There is only one `s' in Chris!



Serenity Now; Serenity Now!!

:^o




Killfile?

:^o

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

Thread

Finally my conclusion aminer <aminer@toto.net> - 2014-04-28 12:47 -0700
  Re: Finally my conclusion "Chris M. Thomasson" <no@spam.invalid> - 2014-04-29 12:49 -0700

csiph-web