A Concurrent Implementation of Skip Graphs

In this extended abstract, we outline a concurrent implementation of a data structure called skip graphs. This data structure, proposed by Aspnes and Shah, has similar functionality to binary search trees, and has also special features that make it suitable for P2P distributed environments. In our implementation, we used non-blockirig locking primitives to synchronize the operations whenever necessary. The resulting implementation performed well in practice, according to our experiments.