arrow
返回

Efficient Concurrent Search Trees Using Portable Fine-Grained Locality

delete2019-07-01
delete0
delete
OA
AI
P
Phuong Hoai Ha *
O
Otto J. Anshus
I
Ibrahim Umar
DOI:10.1109/TPDS.2019.2892968delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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 high concurrency and fine-grained data locality in a platform-independent manner. However, existing portable fine-grained locality-aware search trees such as ones based on the van Emde Boas layout (vEB-based trees) poorly support concurrent update operations while existing highly-concurrent search trees such as non-blocking search trees do not consider fine-grained data locality. In this paper, we first present a novel methodology to achieve both portable fine-grained data locality and high concurrency for search trees. Based on the methodology, we devise a novel locality-aware concurrent search tree called GreenBST. To the best of our knowledge, GreenBST is the first practical search tree that achieves both portable fine-grained data locality and high concurrency. We analyze and compare GreenBST energy efficiency (in operations/Joule) and performance (in operations/second) with seven prominent concurrent search trees on a high performance computing (HPC) platform (Intel Xeon), an embedded platform (ARM), and an accelerator platform (Intel Xeon Phi) using parallel micro-benchmarks (Synchrobench). Our experimental results show that GreenBST achieves the best energy efficiency and performance on all the different platforms. GreenBST achieves up to 50 percent more energy efficiency and 60 percent higher throughput than the best competitor in the parallel benchmarks. These results confirm the viability of our new methodology to achieve both portable fine-grained data locality and high concurrency for search trees.
Keyword:
Concurrent data abstractions
trees
energy efficiency
performance optimization
data locality
portability
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Parallel and Distributed Systems 封面图
IEEE Transactions on Parallel and Distributed Systems
IF:
6
论文数:
5.2K
被引数:
1.1W

机构

L
Lawrence Berkeley National Laboratory
学者数:
1.5W
论文数: 1.1W
被引数: 6.1W
U
united states department of energy (doe)
学者数:
11.3W
论文数: 9.6W
被引数: 246
引用论文

引用论文

Group-Wise Cortical Correspondence via Sulcal Curve-Constrained Entropy Minimization
err2013-01-01
err0
errOAAI
errIlwoo Lyu; Sun Hyung Kim; Joon-Kyung Seong; Sang Wook Yoo; Alan C. Evans; Yundi Shi; Mar Sanchez; Marc Niethammer; Martin A. Styner
err分享
err收藏
err分享
err收藏
err分享
err收藏
Stable isotope analysis of carbon and nitrogen in angrites
err2013-09-12
err0
PREAI
errF. A. J. Abernethy; A. B. Verchovsky; N. A. Starkey; M. Anand; I. A. Franchi; Monica M. Grady
err分享
err收藏
Inter-observer agreement and sensitivity of Optomap images for screening peripheral retinal lesions in patients undergoing refractive surgery
err2020-01-01
err0
errOAAI
errRamesh Venkatesh; JophyPhilips Cherry; NikithaGurram Reddy; Aaditi Anilkumar; Akhila Sridharan; Sajjan Sangai; Rohit Shetty; NareshKumar Yadav; Chaitra Jayadev
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容