###
计算机系统应用英文版:2021,30(12):10-17
本文二维码信息
码上扫一扫!
面向列的内存访问研究综述
(1.天津理工大学 天津市智能计算与软件新技术重点实验室, 天津 300384;2.天津理工大学 学习型智能计算教育部工程研究中心, 天津 300384)
Survey on Column-Oriented Memory Access
(1.Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384, China;2.Engineering Research Center of Learning-Based Intelligent System (Ministry of Education), Tianjin University of Technology, Tianjin 300384, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 975次   下载 3244
Received:February 26, 2021    Revised:March 28, 2021
中文摘要: 在大规模、数据量密集的特定应用场景下, 以行存储访问数据的方式弊端日益凸显, 逐渐不能满足数据高速访问的性能需求, 数据亟需更加高效的传输和处理方式. 因此, 拓展新的内存访问方式, 并且同时兼容行、列方向的访问对提升访问效率、降低整体功耗、节省内存空间有着重要意义. 本文围绕动态随机存储和非易失性存储两个方面来详细介绍实现列方向的内存访问方式, 重点分析了存储单元的结构设计以及实现列向存储访问过程. 最后, 对内存两种不同访问方式进行了比较和总结, 并且对行列访问的内存数据库、数据挖掘、数据加密算法、实时系统的应用场景进行了展望.
Abstract:In large-scale, data-intensive application scenarios, the disadvantages of row storage access to data become increasingly prominent, which is gradually unable to meet the performance requirements for high-speed data access, and data needs more efficient transmission and processing methods. Therefore, it is of great significance to expand new memory access methods compatible with row and column access at the same time to improve access efficiency, reduce overall power consumption, and save memory space. This study focuses on dynamic random storage and non-volatile storage to introduce the column-oriented memory access method in detail, highlighting the analysis of the structural design for storage units and the implementation of the column-oriented memory access process. Finally, the two different ways of memory access are compared and summarized, and row- and column-oriented in-memory databases, data mining, data encryption algorithms, and the application scenarios of real-time systems are forecasted.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(61773286)
引用文本:
陈瑞,夏承遗.面向列的内存访问研究综述.计算机系统应用,2021,30(12):10-17
CHEN Rui,XIA Cheng-Yi.Survey on Column-Oriented Memory Access.COMPUTER SYSTEMS APPLICATIONS,2021,30(12):10-17