检索结果-内蒙古大学图书馆

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2020年第4期5卷 468-484页

作者： Alapati, Praveen Tavva, Venkata Kalyan Mutyam, Madhu Indian Inst Technol Madras Dept CSE Chennai 600036 Tamil Nadu India Indian Inst Technol Ropar Dept CSE Rupnagar 140001 Punjab India

In the recent past, devising algorithms for concurrent data structures has been driven by the need for scalability. Further, there is an increased traction across the industry towards power efficient concurrent data structure designs. In this context, we introduce a scalable and energy-efficient concurrent binary search tree with fatnodes (namely, FatCBST), and present algorithms to perform basic operations on it. Unlike a single node with one value, a fatnode consists of a set of values. FatCBST minimizes structural changes while performing update operations on the tree. In addition, fatnodes help to exploit the spatial locality in the cache hierarchy and also reduce the height of the tree. FatCBST allows multiple threads to perform update operations on an existing fatnode simultaneously. Experimental results show that for low contention workloads as well as large set sizes, FatCBST scales well and also provides high performance-per-watt values as compared to the state-of-the-art implementations. For high contention workloads with small set sizes, FatCBST suffers from contention.

关键词： Vegetation binary search trees Synchronization Instruction sets Energy consumption Scalability concurrent data structures trees concurrent binary search trees throughput and energy optimization

来源：评论

学校读者我要写书评

暂无评论

FatCBST: concurrent binary search Tree with Fatnodes 19

FatCBST: Concurrent Binary Search Tree with Fatnodes

引用

19th IEEE International Conference on High Performance Computing and Communications (HPCC) / 15th IEEE International Conference on Smart City (SmartCity) / 3rd IEEE International Conference on Data Science and Systems (DSS)

作者： Alapati, Praveen Tavva, Venkata Kalyan Mutyam, Madhu Indian Inst Technol Madras Dept Comp Sci & Engn Madras 600036 Tamil Nadu India IBM India Pvt Ltd STG Labs Bengaluru India

ISBN: (纸本)9781538625880

Effective design of concurrent tree implementation plays a major role in improving the scalability of applications in a multicore environment. We introduce a concurrent binary search tree with fatnodes (FatCBST) and present algorithms to perform basic operations on it. Unlike a simple node with single value, a fatnode consists of a set of values. FatCBST concept allows a thread to perform update operations on an existing fatnode without changing the tree structure, making it less disruptive to other threads' operations. Fatnodes help to take advantage of the spatial locality in the cache hierarchy and also reduce the height of the concurrent binary search tree. Our FatCBST implementation allows multiple threads to perform update operations on the same existing fatnode at the same time. Experimental results show that the FatCBST implementations that have small fatnode sizes provide better throughput for high and medium contention workloads;and large fatnode sizes provide better throughput for low contention workloads, as compared to the current state-of-the-art implementations.

关键词： concurrent data structures trees concurrent binary search trees

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：