Software Engineering and Scale-Free Networks
Software Engineering and Scale-Free Networks
复制标题
DOI：
10.1109/tsmcb.2008.2008102
复制
发表时间：
2009-06
期刊：
影响因子：
--
通讯作者：
Lian Wen;R. Dromey;Diana Kirk
中科院分区：
文献类型：
--
作者：
Lian Wen;R. Dromey;Diana Kirk
复杂网络理论是研究物理世界和抽象世界中不同类型大系统的一种新方法。本文从软件工程的角度研究了两种网络：组件依赖网络和排序比较网络。发现它们在一定条件下都表现出与其他领域复杂网络相同的无标度性质。这些结果表明，复杂网络理论可以成为研究软件系统的一个有用的方法。SCNs的特殊性质为研究复杂网络的演化和优化提供了一种更可重复和确定性的方法。他们还指出，排序算法越接近理论最优极限，它的SCN就越像一个无标度网络。这也可能表明，为了有效地存储和检索信息，概念网络可能需要无标度。
Complex-network theory is a new approach in studying different types of large systems in both the physical and the abstract worlds. In this paper, we have studied two kinds of network from software engineering: the component dependence network and the sorting comparison network (SCN). It is found that they both show the same scale-free property under certain conditions as complex networks in other fields. These results suggest that complex-network theory can be a useful approach to the study of software systems. The special properties of SCNs provide a more repeatable and deterministic way to study the evolution and optimization of complex networks. They also suggest that the closer a sorting algorithm is to the theoretical optimal limit, the more its SCN is like a scale-free network. This may also indicate that, to store and retrieve information efficiently, a concept network might need to be scale-free.