5 ms·
On the hardware level for example the x86 some of these atomics translate into instructions with the lock prefix which locks the bus. It's different from the us
by kccqzy 7y ago
On the hardware level for example the x86 some of these atomics translate into instructions with the lock prefix which locks the bus. It's different from the usual "lock" concept in concurrent programming.
- amelius 7y agoIt's still a lock in the sense that it momentarily prevents another process from using a resource.
- kccqzy 7y agoIt is different. The lock prefix in x86 is only relevant in a multiprocessing (i.e. parallel) environment. But the general concept of locking is applicable to concurrent environments as well. For example when there are multiple processes on a uniprocessor machine, you still need to use locks (mutexes) which are implemented using, say, cmpxchg8b (atomically compare and exchange eight bytes), but in the absence of a second processor there's no need to use the lock prefix. Here on a machine level there's never really on any locking, but on an application level you are using locks.
- denormalfloat 7y agoThe correct term to use here is blocking. The hardware bus locks finish in a bounded amount of time and allow the other processors to eventually make progress.
- amelius 7y agoThat is a good distinction, but I'm not sure if it's always true. A peripheral device on a shared bus could still hold the lock for an undetermined time.
- jasonwatkinspdx 7y agoWhen people say "lock the bus" they don't literally mean it's like there's a single bus and mutex. Atomic operations execute atop the cache consistency protocol, which typically looks like: https://en.wikipedia.org/wiki/MOESI_protocol https://en.wikipedia.org/wiki/MOESI_protocol It is indeed true that atomic operations will execute in a bounded time, and processors generally provide fairness guarantees as well.
- amelius 7y agoYes, and the cache hierarchy ultimately depends on the memory bus. I suppose this bus, which may be shared with many other devices, doesn't always have bounded-time guarantee.
- gpderetta 7y agoEven to main memory there is not necessarily a single memory bus. Intracore or even intrasocket synchronization need not (and usually doesn't) go through main memory anyway.
- amelius 7y agoTrue, but some atomic instructions may need to access main memory to complete their operation. Whether shortcuts can be taken in most cases is not relevant for worst-case considerations.
- gpderetta 7y agoSure any memory access might access main memory. There is no special casing for atomic though.
- bonzini 7y agoThey may need to access main memory, but the RMW operation don't happen over the memory bus. The processor appropriates the cache line just like any other memory access, and then operates atomically on the cache line.
- gpderetta 7y agoThe only resource that is held exclusively during an RMW is a single cache line, and that's not due to the lock prefix.
- gpderetta 7y agoOutside of some very exotic scenarios, this hasn't been the case for about 20 years.
- zlynx 7y agoI read about one recently where an evil user program was able to bring a 28 core Xeon to its knees. Apparently a LOCK INC on an unaligned value that hangs over a page boundary forces this super-advanced CPU to lock everything in every cache as if it was a 386.
- gpderetta 7y agoYes, That's the very exotic scenario I had in mind:)
- fulafel 7y agoX86 use MESI derivative directory-based cache coherency protocols on the cache line level (when synchronizing across sockets), bus-locking was probably in the 486/Pentium 1 days when bus snooping was used.