Lockless Patterns: Relaxed Access And Partial Memory Boundaries
Clayton Bevins edited this page 5 days ago


Memory boundaries are an old acquaintance for some Linux kernel programmers. The first doc vaguely resembling a specification of what one could anticipate from concurrent accesses to information within the kernel is, in actual fact, referred to as memory-obstacles.txt. That doc describes many sorts of memory limitations, along with the expectations that Linux has regarding the properties of data and control dependencies. It also describes "memory-barrier pairing"