Abstract
This paper presents a novel method to study Linux kernel evolution using complex networks. Having investigated the node degree distribution and average path length of the call graphs corresponding to the kernel modules of 223 different versions (V1.1.0 to V2.4.35), we found that the call graphs are scale-free and small-world networks. Based on the relationship between average path length and nodes, we propose a method to find unusual points during Linux kernel evolution using the slope of the average path length. Using the unusual points we identify major structural changes in kernel modules. A stability coefficient is also proposed to describe quantitatively the stability of kernel modules during evolution. Finally, we verify our result through Vasas metrics method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
