skip to main content
research-article

Effect of portable fine-grained locality on energy efficiency and performance in concurrent search trees

Published:27 February 2016Publication History
Skip Abstract Section

Abstract

Recent research has suggested that improving fine-grained data-locality is one of the main approaches to improving energy efficiency and performance. However, no previous research has investigated the effect of the approach on these metrices in the case of concurrent data structures.

This paper investigates how fine-grained data locality influences energy efficiency and performance in concurrent search trees, a crucial data structure that is widely used in several important systems. We conduct a set of experiments on three lock-based concurrent search trees: DeltaTree, a portable fine-grained locality-aware concurrent search tree; CBTree, a coarse-grained locality-aware B+tree; and BST-TK, a locality-oblivious concurrent search tree. We run the experiments on a commodity x86 platform and an embedded ARM platform. The experimental results show that DeltaTree has 13--25% better energy efficiency and 10--22% more operations/second on the x86 and ARM platforms, respectively. The results confirm that portable fine-grained locality can improve energy efficiency and performance in concurrent search trees.

References

  1. P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In Proc. 16th Annual Symp. Foundations of Computer Science, SFCS '75, pages 75--84, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Dally. Power and programmability: The challenges of exascale computing. In DoE Arch-I presentation, 2011.Google ScholarGoogle Scholar
  3. T. David, R. Guerraoui, and V. Trigonakis. Asynchronized concurrency: The secret to scaling concurrent search data structures. In Proc. Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS '15, pages 631--644, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. L. Lehman and s. B. Yao. Efficient locking for concurrent operations on b-trees. ACM Trans. Database Syst., 6(4):650--670, Dec. 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Prokop. Cache-oblivious algorithms. Master's thesis, MIT, 1999.Google ScholarGoogle Scholar
  6. I. Umar, O. J. Anshus, and P. H. Ha. Deltatree: A locality-aware concurrent search tree. In Proc. Intl. Conf. on Measurement and Modeling of Comp. Systems, SIGMETRICS '15, pages 457--458, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Effect of portable fine-grained locality on energy efficiency and performance in concurrent search trees

            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!