首页|期刊导航|High Technology Letters|BAR:a branch-alternation-resorting algorithm for locality exploration in graph processing

BAR:a branch-alternation-resorting algorithm for locality exploration in graph processingOA

中文摘要

Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting …查看全部>>

邓军勇;WANG Junjie;JIANG Lin;XIE Xiaoyan;ZHOU Kai

School of Electronic Engineering,Xi''an University of Posts and Telecommunications,Xi''an 710121,P.R.ChinaSchool of Electronic Engineering,Xi''an University of Posts and Telecommunications,Xi''an 710121,P.R.ChinaSchool of Computer,Xi''an University of Science and Technology,Xi''an 710054,P.R.ChinaSchool of Computer,Xi''an University of Posts and Telecommunications,Xi''an 710121,P.R.ChinaSchool of Electronic Engineering,Xi''an University of Posts and Telecommunications,Xi''an 710121,P.R.China

数学

graph processingvertex reorderingbranch-alternation-resorting algorithm(BAR)reconfigurable array processor

《High Technology Letters》 2024 (1)

P.31-42,12

the National Key R&D Program of China(No.2022ZD0119001)the National Natural Science Foundation of China(No.61834005)the Shaanxi Province Key R&D Plan(No.2022GY-027)the Key Scientific Research Project of Shaanxi Department of Education(No.22JY060)the Education Research Project of XUPT(No.JGA202108)the Graduate Student Innovation Fund of Xi''an University of Posts and Telecommunications(No.CXJJZL2022011)。

10.3772/j.issn.1006-6748.2024.01.004

评论

您当前未登录!去登录点击加载更多...