Concurrent Search and Insertion in AVL Trees

@article{Ellis1980ConcurrentSA,
  title={Concurrent Search and Insertion in AVL Trees},
  author={Carla Schlatter Ellis},
  journal={IEEE Transactions on Computers},
  year={1980},
  volume={C-29},
  pages={811-817}
}
This paper addresses the problem of concurrent access to dynamically balanced binary search trees. Specifically, two solutions for concurrent search and insertion in AVL trees are developed. The first solution is relatively simple and is intended to allow several readers to share nodes with a writer process. The second solution uses the first as a starting point and introduces additional concurrency among writers by applying various parallelization techniques. Simulation results used to… CONTINUE READING
Highly Cited
This paper has 66 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

66 Citations

02468'82'89'97'05'13
Citations per Year
Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

-, "Design and evaluation of algorithms for parallel processing," Dep

Carla Schiatter Ellis
Toledo, OH, on August 20, • 1979
View 2 Excerpts

Similar Papers

Loading similar papers…