一种高效的凸连通子图枚举算法-软件学报.pdf

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.12, December 2010, pp.3106−3115 doi: 10.3724/SP.J.1001.2010.03676 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 一种高效的凸连通子图枚举算法 + 薄 拾 , 葛 宁, 林孝康 (清华大学 电子工程系,北京 100084) Efficient Algorithm for Convex Connected Subgraph Enumeration + BO Shi , GE Ning, LIN Xiao-Kang (Department of Electronic Engineering, Tsinghua University, Beijing 100084, China) + Corresponding author: E-mail: boshi99@ Bo S, Ge N, Lin XK. Efficient algorithm for convex connected subgraph enumeration. Journal of Software, 2010,21(12):3106−3115. /1000-9825/3676.htm Abstract : Enumerating convex connected subgraphs from data flow graphs of application hot-spots is required when designing instructions for a configurable processor. To achieve fast enumeration, properties of convex subgraphs of directed acyclic graph are studied. Based on the properties of convex subgraphs and adjacency of vertices, AS (adjacent search), a novel algorithm for enumerating convex connected subgraphs satisfying I/O constraints is presented. Results of experiments show that AS algorithm is more efficient than the existing algorithm, and rate is 10~1000X as fast. While the existing algorithm fails on large scale data-flow graphs, the AS algorithm is still able to accomplish enumeration successfully. Key words: convex connected subgraph; directed acyclic graph; dataflow graph; enumeration; configurable processor; custom instruction 摘 要: 在可配置处理器的定制指令设计过程中,需要提取热点代码数据流图的凸连通子图.为实现子图的快速 枚举,对有向无环图内的凸子图特性进行了研究.根据凸子