• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Ou Yan, Feng Yujing, Li Wenming, Ye Xiaochun, Wang Da, Fan Dongrui. Optimum Research on Inner-Inst Memory Access Conflict for Dataflow Architecture[J]. Journal of Computer Research and Development, 2019, 56(12): 2720-2732. DOI: 10.7544/issn1000-1239.2019.20190115
Citation: Ou Yan, Feng Yujing, Li Wenming, Ye Xiaochun, Wang Da, Fan Dongrui. Optimum Research on Inner-Inst Memory Access Conflict for Dataflow Architecture[J]. Journal of Computer Research and Development, 2019, 56(12): 2720-2732. DOI: 10.7544/issn1000-1239.2019.20190115

Optimum Research on Inner-Inst Memory Access Conflict for Dataflow Architecture

More Information
  • Published Date: November 30, 2019
  • The rapid development of artificial intelligence application, such as neural network, image recognition and test recognition, brings huge challenges to traditional processors. Coarse-grained dataflow architectures become hotspot for AI application because it possesses the characteristic of high instruction-level parallelism. At the same time, it remains broadly applicable and adaptable. However, with processing elements of coarse-dataflow adapt random access memory as memory, combined with the property of intensive memory requirement of neural networks, there are lots of memory access conflicts in inner-inst. After analyzing the memory access behavior of AI applications, it is found that there are a large number of inner-inst memory access conflicts which greatly degrade the utilization of computing units. Based on this observation, in dataflow processors, a flexible data redundancy strategy (FRS) for inner-inst memory access conflict is proposed to allocate multi-storage for operand access requests which induce conflicts in inner-inst during compile stage. By using FRS, the number of conflicts in the RAM is effectively degraded. We use typical AI application benchmarks in the experiments, such as LeNet, AlexNet. The experimental results show that FRS improves power efficiency by 30.21% and 12.37% compared with Round-Robin none-data redundancy strategy and Re-Hash none-data redundancy strategy, and by 27.95% compared with 2 multi-data redundancy strategy.
  • Related Articles

    [1]Fu Nan, Ni Weiwei, Jiang Zepeng, Hou Lihe, Zhang Dongyue, Zhang Ruyu. Directed Graph Clustering Algorithm with Edge Local Differential Privacy[J]. Journal of Computer Research and Development, 2025, 62(1): 256-268. DOI: 10.7544/issn1000-1239.202330193
    [2]Xia Sibo, Ma Minghua, Jin Pengxiang, Cui Liyue, Zhang Shenglin, Jin Wa, Sun Yongqian, Pei Dan. Response Time Anomaly Diagnosis for Search Service[J]. Journal of Computer Research and Development, 2024, 61(6): 1573-1584. DOI: 10.7544/issn1000-1239.202330054
    [3]Zhang Xiaojian, Xu Yaxin, Fu Nan, Meng Xiaofeng. Towards Private Key-Value Data Collection with Histogram[J]. Journal of Computer Research and Development, 2021, 58(3): 624-637. DOI: 10.7544/issn1000-1239.2021.20200319
    [4]Ding Yong, Li Jiahui, Tang Shijie, Wang Huiyong. Template Protection of Speaker Recognition Based on Random Mapping Technology[J]. Journal of Computer Research and Development, 2020, 57(10): 2201-2208. DOI: 10.7544/issn1000-1239.2020.20200474
    [5]Li Shengdong, Lü Xueqiang. Static Restart Stochastic Gradient Descent Algorithm Based on Image Question Answering[J]. Journal of Computer Research and Development, 2019, 56(5): 1092-1100. DOI: 10.7544/issn1000-1239.2019.20180472
    [6]Chen Chi, Feng Dengguo, and Xu Zhen. Research on Database Transaction Recovery Log and Intrusion Response[J]. Journal of Computer Research and Development, 2010, 47(10): 1797-1804.
    [7]Mu Chengpo, Huang Houkuan, Tian Shengfeng, Li Xiangjun. A Survey of Intrusion Response Decision-Making Techniques of Automated Intrusion Response Systems[J]. Journal of Computer Research and Development, 2008, 45(8): 1290-1298.
    [8]Shi Jin, Lu Yin, and Xie Li. Dynamic Intrusion Response Based on Game Theory[J]. Journal of Computer Research and Development, 2008, 45(5): 747-757.
    [9]Liu Li, Wang Zhaoqi, Xia Shihong, Li Chunpeng. Research on Directional Penetration Depth Algorithm in Collision Response[J]. Journal of Computer Research and Development, 2008, 45(3): 519-526.
    [10]Shi Rui and Yang Xiaozong. Research on the Node Spatial Probabilistic Distribution of the Random Waypoint Mobility Model for Ad Hoc Network[J]. Journal of Computer Research and Development, 2005, 42(12): 2056-2062.
  • Cited by

    Periodical cited type(6)

    1. 付楠,倪巍伟,姜泽鹏,侯立贺,张东月,张如玉. 基于本地边差分隐私的有向图聚类算法. 计算机研究与发展. 2025(01): 256-268 . 本站查看
    2. 彭鹏,倪志伟,朱旭辉,陈千. 改进萤火虫群算法协同差分隐私的干扰轨迹发布. 计算机应用. 2024(02): 496-503 .
    3. 刘利康,周春来. RCP:本地差分隐私下的均值保护技术. 计算机科学. 2023(02): 333-345 .
    4. 陈叶旺,曹海露,陈谊,康昭,雷震,杜吉祥. 面向大规模数据的DBSCAN加速算法综述. 计算机研究与发展. 2023(09): 2028-2047 . 本站查看
    5. 尹诗玉,朱友文,张跃. 效用优化的本地差分隐私联合分布估计机制. 计算机科学. 2023(10): 315-326 .
    6. 琚晓颖,何金莉,石琇赟,李顺勇. 基于拉普拉斯机制的集成分类隐私保护研究. 长江信息通信. 2022(08): 23-27 .

    Other cited types(9)

Catalog

    Article views (981) PDF downloads (439) Cited by(15)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return