Memory barriers: Difference between revisions
Jump to navigation
Jump to search
| [unchecked revision] | [unchecked revision] |
Content added Content deleted
No edit summary |
m (stub + trying to add category) |
||
| Line 10: | Line 10: | ||
[http://www.gelato.unsw.edu.au/lxr/source/Documentation/memory-barriers.txt Documentation with explanations on what memory barriers are used in linux kernel and why.] |
[http://www.gelato.unsw.edu.au/lxr/source/Documentation/memory-barriers.txt Documentation with explanations on what memory barriers are used in linux kernel and why.] |
||
{{stub}} |
|||
[[Category:Synchronization]] |
|||
Revision as of 23:07, 6 February 2009
Memory barriers ensure ordering of load/store commands.
Usually CPUs and compilers reorder these instructions for more efficient execution. Lock-free algorithms often require that perceived execution order be strict, that's when memory barriers or memory fences come in handy.
More detailed description in following articles:
Memory Ordering in Modern Microprocesors, Part 1 and Part 2
Ridiculous Fish's controversial article about using and abusing memory barriers. (and bashing of this article just for a different POV)
Documentation with explanations on what memory barriers are used in linux kernel and why.
This page is a stub.
You can help the wiki by accurately adding more contents to it.