- Run this under Windows and Linux - 10 Updates
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 11:44AM -0700 On 11/4/2023 8:53 AM, Scott Lurndal wrote: >> CMPXCHG cannot fail spuriously. However, LL/SC can. > LL/SC is not compare and swap. LL/SC can be used to implement a weak CAS. Also, wrt the algorithm, it can be used to implement a strong CAS. CMPXCHG over on intel cannot be used to implement a weak CAS. |
| Bonita Montero <Bonita.Montero@gmail.com>: Nov 04 07:58PM +0100 Am 04.11.2023 um 17:03 schrieb Scott Lurndal: > BTW - Compare and Swap was invented by an engineer at IBM - > ... The idea is not that complex that it would have been invented by a lot of technichians later. I think that LL/SC is more sexy since it allows lock-free stacks with one word. |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 11:45AM -0700 On 11/4/2023 9:03 AM, Scott Lurndal wrote: > for inclusion in 370 to CS (compare and swap) and CDS (compare double and swap). > the instructions have since been expanded for 64-bit operation and a > new "perform locked operation" has since been added. Yup. I have actually conversed with Lynn over on comp.arch. Very smart person loaded up with knowledge. |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 12:14PM -0700 On 11/4/2023 11:58 AM, Bonita Montero wrote: > The idea is not that complex that it would have been invented by > a lot of technichians later. I think that LL/SC is more sexy since > it allows lock-free stacks with one word. Just be careful wrt the reservation granularity. LL/SC can be prone to livelock. |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 12:42PM -0700 On 11/4/2023 2:25 AM, Bonita Montero wrote: > thread, although this usually doesn't happen. > It's just the surrounding code that successfully locked a mutex that > "knows" it is the owner. The surrounding code is the mutex. It can use a kernel semaphore for slow paths. You seem to be radically confused. |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 12:44PM -0700 On 11/4/2023 2:17 AM, Bonita Montero wrote: >> Oh shit. You have dug yourself into a really deep hole here, Bonita. > The benaphore does know that it is owned, but not by whom. > Its the surrounding code that knows that it owns the mutex. Oh god. The benaphore is a semaphore. Mutex logic using a semaphore for a slow path is different than a semaphore. God damn, man... You are confused and/or trolling? Humm... |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 12:45PM -0700 On 11/4/2023 2:18 AM, Bonita Montero wrote: >> semaphore for slow paths. > There isn't sth. like a userspace semaphore since with a sempahore > you need support to sleep or to be awakened. Huh? The point of the benaphore (a semaphore) is to try to avoid going into the kernel to sleep or to be awakened. God damn it Bonita! |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 12:51PM -0700 On 11/4/2023 2:19 AM, Bonita Montero wrote: >> here. Think about it... > Google for "benaphore mutex" and you'll find several refernces that a > benaphore is a mutex, including the two articles I've referred so far. MORON!!! |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 12:53PM -0700 On 11/4/2023 12:51 PM, Chris M. Thomasson wrote: >> Google for "benaphore mutex" and you'll find several refernces that a >> benaphore is a mutex, including the two articles I've referred so far. > MORON!!! The benaphore is a semaphore using a bakery algorithm. You are completely confused and incoherently flailing around. |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Nov 04 12:54PM -0700 On 11/4/2023 12:53 PM, Chris M. Thomasson wrote: >> MORON!!! > The benaphore is a semaphore using a bakery algorithm. You are > completely confused and incoherently flailing around. https://vorbrodt.blog/2019/02/05/fast-semaphore |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment