• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wu Linyang, Luo Rong, Guo Xueting, Guo Qi. Partitioning Acceleration Between CPU and DRAM: A Case Study on Accelerating Hash Joins in the Big Data Era[J]. Journal of Computer Research and Development, 2018, 55(2): 289-304. DOI: 10.7544/issn1000-1239.2018.20170842
Citation: Wu Linyang, Luo Rong, Guo Xueting, Guo Qi. Partitioning Acceleration Between CPU and DRAM: A Case Study on Accelerating Hash Joins in the Big Data Era[J]. Journal of Computer Research and Development, 2018, 55(2): 289-304. DOI: 10.7544/issn1000-1239.2018.20170842

Partitioning Acceleration Between CPU and DRAM: A Case Study on Accelerating Hash Joins in the Big Data Era

More Information
  • Published Date: January 31, 2018
  • Hardware acceleration has been very effective in improving energy efficiency of existing computer systems. As traditional hardware accelerator designs (e.g. GPU, FPGA and customized accelerators) remain decoupled from main memory systems, reducing the energy cost of data movement remains a challenging problem, especially in the big data era. The emergence of near-data processing enables acceleration within the 3D-stacked DRAM to greatly reduce the data movement cost. However, due to the stringent area, power and thermal constraints on the 3D-stacked DRAM, it is nearly impossible to integrate all computation units required for a sufficiently complex functionality into the DRAM. Therefore, there is a need to design the memory side accelerator with this partitioning between CPU and accelerator in mind. In this paper, we describe our experience with partitioning the acceleration of hash joins, a key functionality for databases and big data systems, using a data-movement driven approach on a hybrid system, containing both memory-side customized accelerators and processor-side SIMD units. The memory-side accelerators are designed for accelerating execution phases that are bounded by data movements, while the processor-side SIMD units are employed for accelerating execution phases with negligible data movement cost. Experimental results show that the hybrid accelerated system improves energy efficiency up to 47.52x and 19.81x, compared with the Intel Has well and Xeon Phi processor, respectively. Moreover, our data-movement driven design approach can be easily extended to guide the design decisions of accelerating other emerging applications.
  • Related Articles

    [1]Zhao Liang, Wang Yongli, Du Zhongshu, Chen Guangsheng. HL-DAQ: A Dynamic Adaptive Quantization Coding for Hash Learning[J]. Journal of Computer Research and Development, 2018, 55(6): 1294-1307. DOI: 10.7544/issn1000-1239.2018.20170238
    [2]WuTao, JinJianguo, WeiMingjun. A Hash Function Algorithm Based on Variable Parameter Cascade Chaos[J]. Journal of Computer Research and Development, 2016, 53(3): 674-681. DOI: 10.7544/issn1000-1239.2016.20148155
    [3]Wang Wendi, Tang Wen, Duan Bo, Zhang Chunming, Zhang Peiheng, Sun Ninghui. Parallel Accelerator Design for High-Throughput DNA Sequence Alignment with Hash-Index[J]. Journal of Computer Research and Development, 2013, 50(11): 2463-2471.
    [4]Yuan Xinpan, Long Jun, Zhang Zuping, Luo Yueyi, Zhang Hao, and Gui Weihua. Connected Bit Minwise Hashing[J]. Journal of Computer Research and Development, 2013, 50(4): 883-890.
    [5]Qin Chuan, Chang Chin Chen, Guo Cheng. Perceptual Robust Image Hashing Scheme Based on Secret Sharing[J]. Journal of Computer Research and Development, 2012, 49(8): 1690-1698.
    [6]Xu Jian, Zhou Fucai, Yang Muzhou, Li Fuxiang, Zhu Zhiliang. Hierarchical Hash List for Distributed Query Authentication[J]. Journal of Computer Research and Development, 2012, 49(7): 1533-1544.
    [7]Fu Jianqing, Wu Chunming, Wu Jiyi, Ping Lingdi. Reverse Hash Chain Traversal Based on Binary Tree[J]. Journal of Computer Research and Development, 2012, 49(2): 294-303.
    [8]Deng Yadan, Jing Ning, and Xiong Wei. Nested Loop Join Optimization Based on Radix-Join in Chip Multi-Processor[J]. Journal of Computer Research and Development, 2010, 47(6): 1079-1087.
    [9]Ding Zhenhua, Li Jintao, Feng Bo. Research on Hash-Based RFID Security Authentication Protocol[J]. Journal of Computer Research and Development, 2009, 46(4): 583-592.
    [10]Li Zhiqiang, Chen Hanwu, Xu Baowen, Liu Wenjie. Fast Algorithms for Synthesis of Quantum Reversible Logic Circuits Based on Hash Table[J]. Journal of Computer Research and Development, 2008, 45(12): 2162-2171.
  • Cited by

    Periodical cited type(3)

    1. 吴婧雅,卢文岩,鄢贵海,李晓维. HyperTree:高并发B+树索引加速器. 计算机研究与发展. 2023(07): 1661-1677 . 本站查看
    2. 郜攀峰. 基于大数据分析技术的高校毕业就业状况分析. 现代电子技术. 2020(18): 47-49+53 .
    3. 严格非. 大数据处理技术与系统研究. 信息与电脑(理论版). 2018(05): 138-139 .

    Other cited types(0)

Catalog

    Article views (1486) PDF downloads (553) Cited by(3)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return