计算机应用与软件2017，Vol.34Issue(12)：26-31,6.DOI:10.3969/j.issn.1000-386x.2017.12.005
基于K-最短路径的大规模函数调用关系分析
ANALYSYS OF LARGE-SCALE FUNCTION CALL RELATION BASED ON K-SHORTEST PATH
张晶晶 1石剑君 1高玉金 1计卫星1
作者信息
- 1. 北京理工大学计算机学院,北京100081
- 折叠
摘要
Abstract
The function call relationship reflects the dependency between the functions in software system,and has been widely used in much software engineering fields,such as software analysis,software testing and software maintenance.However,in large complex software search between the two functions of the call relationship,due to the large number of functions,calls between the complex relationships,making the search takes longer.In order to obtain the calling path between any two functions,we proposed to use K-shortest path algorithm and optimize the K-shortest path algorithm to reduce the search time,which was convenient for users to analyze the function call relationship.Through the analysis of Linux kernel 3.19 (including more than 400,000 function nodes and 110 million call relationships),the experimental results showed that through the parallel optimization,parallel speed was 5 ～ 6 times than the average.关键词
函数调用关系/K-最短路径/路径搜索/Linux内核Key words
Function call relationship/K-shortest/Path search/Linux kernel分类
信息技术与安全科学引用本文复制引用
张晶晶,石剑君,高玉金,计卫星..基于K-最短路径的大规模函数调用关系分析[J].计算机应用与软件,2017,34(12):26-31,6.
