3 ms·
X86 will always be slower because it has stricter memory ordering semantics.
by layer8 4y ago
X86 will always be slower because it has stricter memory ordering semantics.
- kersplody 4y agoNot really an issue under most usage scenarios. x86 suffers mostly from the cost and complexity of the decode unit. Once decoded instructions are cached, the performance penalty mostly disappears.
- erichocean 4y agoOrdering semantics (TSO) that Apple's M1 implements. I guess it should be slower too?
- layer8 4y agoM1 implements TSO as a special mode specifically for x86 compatibility: https://github.com/saagarjha/TSOEnabler https://github.com/saagarjha/TSOEnabler If TSO didn’t have a performance penalty, it wouldn’t need to be a separate mode. Also, it should be obvious that stricter ordering constraints inherently allow less parallelism, so lower performance.
- hajile 4y agoAnd it is a LOT slower to run rosetta apps instead of native ones despite all the silicon thrown into emulation. If it were as simple as "they are the same once everything is decoded", then you'd expect a pre-decoded and pre-optimized program to be at least as fast, but it's not.