Synchronization: Difference between revisions
No edit summary |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
When multiple execution contexts want to share data, synchronization must [[Lock-free algorithms|typically be used]] to | When multiple execution contexts want to share data, synchronization must [[Lock-free algorithms|typically be used]] to ensure mutual exclusion among those accesses. Care must be taken in the presence of constructed operations (64-bit math on a 32-bit processor, for instance), memory access reordering, and compiler optimizations if this synchronization is to be effective and robust. | ||
==See Also== | ==See Also== | ||
* [http://www.rdrop.com/users/paulmck/scalability/paper/whymb.2010.06.07c.pdf "Memory Barriers: A Guide for Software Hackers"] | * [http://www.rdrop.com/users/paulmck/scalability/paper/whymb.2010.06.07c.pdf "Memory Barriers: A Guide for Software Hackers"] | ||
[[CATEGORY: Hardware]] | [[CATEGORY: Hardware]] | ||