Improved time bounds for linearizable implementations of abstract data types

Linearizability is a well-known consistency condition for shared objects in concurrent systems. We focus on the problem of implementing linearizable objects of arbitrary data types in message-passing systems with bounded, but uncertain, message delay and bounded, but non-zero, clock skew. We present an algorithm that exploits axiomatic properties of different operations to reduce the running time of each operation below that obtainable with previously known algorithms. We also prove lower bounds on the time complexity of various kinds of operations, specified by the axioms they satisfy, resulting in reduced gaps in some cases and tight bounds in others.

Authors

• Jiaqi Wang
• Edward Talmage
• Hyunyoung Lee
• Jennifer L. Welch

Keywords

• Abstract data types
• Distributed computing
• Linearizability
• Time bounds