skip to main content
abstract

CASTLE: fast concurrent internal binary search tree using edge-based locking

Published:24 January 2015Publication History
Skip Abstract Section

Abstract

We present a new lock-based algorithm for concurrent manipulation of a binary search tree in an asynchronous shared memory system that supports search, insert and delete operations. Some of the desirable characteristics of our algorithm are: (i) a search operation uses only read and write instructions, (ii) an insert operation does not acquire any locks, and (iii) a delete operation only needs to lock up to four edges in the absence of contention. Our algorithm is based on an internal representation of a search tree and it operates at edge-level (locks edges) rather than at node-level (locks nodes); this minimizes the contention window of a write operation and improves the system throughput. Our experiments indicate that our lock-based algorithm outperforms existing algorithms for a concurrent binary search tree for medium-sized and larger trees, achieving up to 59% higher throughput than the next best algorithm.

References

  1. F. Ellen, P. Fataourou, E. Ruppert, and F. van Breugel. Non-Blocking Binary Search Trees. In Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pages 131–140, July 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. V. Howley and J. Jones. A Non-Blocking Internal Binary Search Tree. In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 161–171, June 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Natarajan and N. Mittal. Fast Concurrent Lock-Free Binary Search Trees. In Proceedings of the 19th ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 317–328, Feb. 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Ramachandran and N. Mittal. CASTLE: Fast Concurrent Internal Binary Search Tree using Edge-Based Locking. Technical Report UTDCS-17-14, Department of Computer Science, The University of Texas at Dallas, 2014.Google ScholarGoogle Scholar

Index Terms

  1. CASTLE: fast concurrent internal binary search tree using edge-based locking

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader
                About Cookies On This Site

                We use cookies to ensure that we give you the best experience on our website.

                Learn more

                Got it!