Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Concurrent Search Tree by Lazy Splaying Yehuda Afek Boris Korenfeld Adam Morrison

Summary: Concurrent Search Tree by Lazy Splaying
Yehuda Afek Boris Korenfeld Adam Morrison
School of Computer Science
Tel Aviv University
In many search tree (maps) applications the distribution of items accesses is non-uniform,
with some popular items accessed more frequently than others. Traditional self-adjusting tree
algorithms adapt to the access pattern, but are not suitable for a concurrent setting since they
constantly move items to the tree's root, turning the root into a sequential hot spot. Here we
present lazy splaying, a new search tree algorithm that moves frequently accessed items close
to the root without making the root a bottleneck. Lazy splaying is fast and highly scalable
making at most one local adjustment to the tree on each access. It can be combined with other
sequential or concurrent search tree algorithms. In the experimental evaluation we integrated
lazy splaying into Bronson et. al.'s optimistic search tree implementation to get a concurrent
highly scalable search tree, and show that it significantly improves performance on realistic
non-uniform access patterns, while only slightly degrading performance for uniform accesses.
Contact Author:
Yehuda Afek
Phone: +972-544-797322
Fax: +972-3-640-9357


Source: Afek, Yehuda - School of Computer Science, Tel Aviv University


Collections: Computer Technologies and Information Sciences