arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.10370cs.DS
收藏

非对称存储器的数学构建块

Algorithmic Building Blocks for Asymmetric Memories

Yan Gu, Yihan Sun, Guy E. Blelloch

摘要:

主存储器的未来似乎在于新的非易失性存储器技术的方向,这些技术提供强大的容量-性能比,但在能量、带宽和延迟方面具有比读取昂贵得多的写入操作。这种不对称性会对算法设计产生显著影响,在许多情况下,可以以读取为代价来减少写入。在本文中,我们研究的算法技术是有用的,在设计实用的写效率的算法。我们专注于几个基本的算法构建块,包括无序集/映射实现使用哈希表,有序集/映射实现使用各种二叉搜索树,比较排序,和图遍历算法,包括广度优先搜索和Dijkstra算法。我们引入新的算法和实现,可以减少写入,并使用软件模拟器进行实验分析的性能。最后,我们总结了有趣的经验教训和设计写效率的算法的方向。

英文摘要:

The future of main memory appears to lie in the direction of new non-volatile memory technologies that provide strong capacity-to-performance ratios, but have write operations that are much more expensive than reads in terms of energy, bandwidth, and latency. This asymmetry can have a significant effect on algorithm design, and in many cases it is possible to reduce writes at the cost of reads. In this paper, we study which algorithmic techniques are useful in designing practical write-efficient algorithms. We focus on several fundamental algorithmic building blocks including unordered set/map implemented using hash tables, ordered set/map implemented using various binary search trees, comparison sort, and graph traversal algorithms including breadth-first search and Dijkstra's algorithm. We introduce new algorithms and implementations that can reduce writes, and analyze the performance experimentally using a software simulator. Finally we summarize interesting lessons and directions in designing write-efficient algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑