Vladimir Lanin

Learn More
Set manipulation consists of the actions <italic>insert, delete</italic>, and <italic>member</italic> on keys. We propose a concurrent set manipulation algorithm that uses no locking at all and requires no aborts, relying instead on atomic read-modify-write operations on single (data) locations. The algorithm satisfies order-preserving serializability(More)
  • 1