Topology Characters of the Linux Call Graph

A call graph is a directed graph in which nodes are functional units and arcs are call events, it is used to represent the call relationship of the program. Generally speaking, call graph plays a very important role in program analysis, and it has been widely used in software engineering (e.g., program understanding, compiling optimization, regression test, etc). In the present paper, we studied the giant strong component of the call graph of the Linux kernel (v2.6.27) with the rising complex network theory. We analyzed some basic topological characteristic of the giant strong component, and we also identified the top 20 functional units.