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.
- 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 Scholar
Digital Library
- B. Dally. Power and programmability: The challenges of exascale computing. In DoE Arch-I presentation, 2011.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- H. Prokop. Cache-oblivious algorithms. Master's thesis, MIT, 1999.Google Scholar
- 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 Scholar
Digital Library
Index Terms
Effect of portable fine-grained locality on energy efficiency and performance in concurrent search trees
Recommendations
DeltaTree: A Locality-aware Concurrent Search Tree
SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer SystemsLike other fundamental abstractions for high-performance computing, search trees need to support both high concurrency and data locality. However, existing locality-aware search trees based on the van Emde Boas layout (vEB-based trees), poorly support ...
Effect of portable fine-grained locality on energy efficiency and performance in concurrent search trees
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingRecent 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 ...
Efficient Concurrent Search Trees Using Portable Fine-Grained Locality
Concurrent search trees are crucial data abstractions widely used in many important systems such as databases, file systems and data storage. Like other fundamental abstractions for energy-efficient computing, concurrent search trees should support both ...






Comments