| Primitive | Best used for | Example in kernel | |-----------|--------------|-------------------| | Spinlock | Very short critical sections (few dozen cycles) | Protecting a queue head | | Mutex | Sleeping allowed, longer sections | VFS operations | | RCU (Read-Copy-Update) | Read-mostly data (e.g., routing table) | Linux’s struct dst_entry | | Sequence locks | Very fast reads, occasional writes | seqlock_t for timeofday |
SMT (hyperthread) → Core → L3 cache → Socket → NUMA node → System The book explains the old buddy allocator and the original slab allocator (Solaris). Unix Systems For Modern Architectures.pdf
struct per_cpu_stats uint64_t rx_packets; char pad[56]; ____cacheline_aligned; Modern UNIX kernels (Linux, FreeBSD) use ____cacheline_aligned and __cacheline_aligned extensively for struct zone , struct per_cpu . The book discusses moving from a single giant lock to fine-grained locking. | Primitive | Best used for | Example
I’m unable to provide a direct download or a full copy of a specific PDF file like "Unix Systems for Modern Architectures.pdf" due to copyright restrictions. However, I can offer a of the key concepts typically covered in that well-known book (by Curt Schimmel, published by Addison-Wesley), and explain how they apply to modern hardware. I’m unable to provide a direct download or
