高通量计算机的图算法优化技术分析  

Analysis of Graph Algorithm Optimization Techniques for High Throughput Computers

作　　者：刘翔[1] LIU Xiang(Sichuan City Vocational College,Sichuan 610100,China)

机构地区：[1]四川城市职业学院,四川610100

出　　处：《集成电路应用》2024年第9期186-187,共2页Application of IC

摘　　要：阐述高通量计算机在图计算中的应用,介绍高并发、功耗低和强实时能力的优点。探讨历程优化、顶点排序优化、静态shuffle优化和度数感知优化的多种图算法优化策略,以及BFS算法优化策略。This paper describes the application of high-throughput computers in graph computing,introducing the advantages of high concurrency,low power consumption,and strong real-time capability.It explores various graph algorithm optimization strategies for process optimization,vertex sorting optimization,static shuffle optimization,and degree aware optimization,as well as BFS algorithm optimization strategies.

关 键 词：高通量计算机 图算法优化技术 Bottom-up历程优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP391.41[自动化与计算机技术—控制科学与工程]