A Non-blocking Self-Organizing Linked List Algorithm

Self-organizing linked lists perform well for handling requests with strong locality. Non-blocking shared data structures are robust and reliable. We present the first non-blocking self-organizing linked list algorithm which supports linearizable search, insert and remove operations. The experimental results show that our algorithm performs well for long linked lists with high percentages of search operations.