Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #1562
| From | "Chris M. Thomasson" <no@spam.invalid> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | Re: RWLock explanation |
| Date | 2013-06-19 17:45 -0700 |
| Organization | Aioe.org NNTP Server |
| Message-ID | <kptjc4$glf$1@speranza.aioe.org> (permalink) |
| References | <kpt7eo$5o1$1@dont-email.me> |
"aminer" wrote in message news:kpt7eo$5o1$1@dont-email.me... > Hello, > I have wrote a webpage that explains my RWLock algorithm, here it is: > http://pages.videotron.com/aminer/rwlock.html Have you tried to run this though a race detection algorithm? FWIW, here is a solid fast-path starvation-free bounded time read-write mutex algorithm I invented and posted here a while back: http://software.intel.com/en-us/forums/topic/296471 (read all please) AFAICT, it outperformed all native OS rwmutex implementations I have tested against. It probably still does. At least it beats windows native rw mutex algorithm. BTW, I have run this algorithm through Relacy Race Detector, and others, many, many times indeed! ;^) Also, here is the most elegant and compact rwmutex spinlock algorithm I have ever seen: https://groups.google.com/forum/?fromgroups#!msg/comp.programming.threads/_FtyJJAErGU/GvksDOZ2Pp8J Bakery algorithms are simply the best! :^)
Back to comp.programming.threads | Previous | Next — Next in thread | Find similar
Re: RWLock explanation "Chris M. Thomasson" <no@spam.invalid> - 2013-06-19 17:45 -0700 Re: RWLock explanation "Chris M. Thomasson" <no@spam.invalid> - 2013-06-19 17:54 -0700
csiph-web