Fissile Locks

03/10/2020
by   Dave Dice, et al.
0

Classic test-and-test (TS) mutual exclusion locks are simple, and enjoy high performance and low latency of ownership transfer under light or no contention. However, they do not scale gracefully under high contention and do not provide any admission order guarantees. Such concerns led to the development of scalable queue-based locks, such as a recent Compact NUMA-aware (CNA) lock, a variant of another popular queue-based MCS lock. CNA scales well under load and provides certain admission guarantees, but has more complicated lock handover operations than TS and incurs higher latencies at low contention. We propose Fissile locks, which capture the most desirable properties of both TS and CNA. A Fissile lock consists of two underlying locks: a TS lock, which serves as a fast path, and a CNA lock, which serves as a slow path. The key feature of Fissile locks is the ability of threads on the fast path to bypass threads enqueued on the slow path, and acquire the lock with less overhead than CNA. Bypass is bounded (by a tunable parameter) to avoid starvation and ensure long-term fairness. The result is a highly scalable NUMA-aware lock with progress guarantees that performs like TS at low contention and like CNA at high contention.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2022

wCQ: A Fast Wait-Free Queue with Bounded Memory Usage

The concurrency literature presents a number of approaches for building ...
research
02/07/2021

Hemlock : Compact and Scalable Mutual Exclusion

We present Hemlock, a novel mutual exclusion locking algorithm that is e...
research
09/02/2022

Dual Queue Coupled AQM: Deployable Very Low Queuing Delay for All

On the Internet, sub-millisecond queueing delay and capacity-seeking hav...
research
06/29/2018

Dynamic Power Allocation and User Scheduling for Power-Efficient and Low-Latency Communications

In this paper, we propose a joint dynamic power control and user pairing...
research
09/02/2021

Multi-Queues Can Be State-of-the-Art Priority Schedulers

Designing and implementing efficient parallel priority schedulers is an ...
research
01/08/2020

XOR-based Source Routing

We introduce a XOR-based source routing (XSR) scheme as a novel approach...
research
12/19/2017

Enabling Work-conserving Bandwidth Guarantees for Multi-tenant Datacenters via Dynamic Tenant-Queue Binding

Today's cloud networks are shared among many tenants. Bandwidth guarante...

Please sign up or login with your details

Forgot password? Click here to reset