Improved time bounds for linearizable implementations of abstract data types Academic Article uri icon

abstract

  • © 2018 Elsevier Inc. 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.

author list (cited authors)

  • Wang, J., Talmage, E., Lee, H., & Welch, J. L.

citation count

  • 0

publication date

  • December 2018