
TL;DR
This paper introduces a compact NUMA-aware lock that uses only one word of memory, improves performance under contention, and is suitable for space-constrained systems like the Linux kernel.
Contribution
A novel, space-efficient NUMA-aware lock based on MCS that organizes threads into two queues, reducing remote cache misses without increasing memory footprint.
Findings
Achieves single-thread performance comparable to MCS lock.
Outperforms existing NUMA-aware locks under contention.
Requires only one word of memory regardless of socket count.
Abstract
Modern multi-socket architectures exhibit non-uniform memory access (NUMA) behavior, where access by a core to data cached locally on a socket is much faster than access to data cached on a remote socket. Prior work offers several efficient NUMA-aware locks that exploit this behavior by keeping the lock ownership on the same socket, thus reducing remote cache misses and inter-socket communication. Virtually all those locks, however, are hierarchical in their nature, thus requiring space proportional to the number of sockets. The increased memory cost renders NUMA-aware locks unsuitable for systems that are conscious to space requirements of their synchronization constructs, with the Linux kernel being the chief example. In this work, we present a compact NUMA-aware lock that requires only one word of memory, regardless of the number of sockets in the underlying machine. The new lock…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Parallel Computing and Optimization Techniques · Advanced Data Storage Technologies
