An Efficient Universal Construction for Large Objects

TL;DR

This paper introduces L-UC, a wait-free universal construction for large, dynamically changing objects, with improved step complexity of O(n+kw), enabling efficient implementation of large state objects in concurrent systems.

Contribution

The paper proposes a novel universal construction, L-UC, that efficiently supports large, dynamically changing objects with improved step complexity in wait-free concurrent environments.

Findings

L-UC achieves O(n+kw) step complexity.

It efficiently handles large, dynamically changing object states.

L-UC outperforms previous constructions in efficiency and scalability.

Abstract

This paper presents L-UC, a universal construction that efficiently implements dynamic objects of large state in a wait-free manner. The step complexity of L-UC is O(n+kw), where n is the number of processes, k is the interval contention (i.e., the maximum number of active processes during the execution interval of an operation), and w is the worst-case time complexity to perform an operation on the sequential implementation of the simulated object. L-UC efficiently implements objects whose size can change dynamically. It improves upon previous universal constructions either by efficiently handling objects whose state is large and can change dynamically, or by achieving better step complexity.