Algorithmic complexity of the truck factor calculation

被引:6
作者
Hannebauer, Christoph [1 ]
Gruhn, Volker [1 ]
机构
[1] Paluno – The Ruhr Institute for Software Technology, University of Duisburg-Essen
来源
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8892卷
关键词
Algorithmic complexity; Project survivability; Truck factor;
D O I
10.1007/978-3-319-13835-0_9
中图分类号
学科分类号
摘要
Software development projects differ in their sensitivity to losing developers. Some projects must stop already if they lose a few developers, while other projects can continue if the same number of developers leave the project. The Truck Factor (TF) quantifies these differences: It is the number of developers that would stop the project if they left the project.Multiple specific variants of the TF have been suggested in literature. This paper proves that some of these implementations are actually NP-hard to compute, including the promising worst-case metric TFmin,c. NP-hardness prevents their use for large software development projects. For the TF variants not proved to be NP-hard, this paper provides efficient algorithms. However, this paper argues that these TF variants have less explanatory power. © Springer International Publishing Switzerland 2014.
引用
收藏
页码:119 / 133
页数:14
相关论文
共 7 条
[1]  
Beck K., Andres C., Extreme Programming Explained: Embrace Change, (2004)
[2]  
Bowler M.
[3]  
Goetgheluck P., Computing binomial coefficients, The American Mathematical Monthly, 94, 4, pp. 360-365, (1987)
[4]  
Karp R.M., Reducibility among combinatorial problems, Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85-103, (1972)
[5]  
Ricca F., Marchetto A., Torchiano M., On the difficulty of computing the truck factor, PROFES 2011. LNCS, 6759, pp. 337-351, (2011)
[6]  
Zazworka N., Stapel K., Knauss E., Shull F., Basili V.R., Schneider K., Are Developers Complying with the Process: An XP Study, Proceedings of the 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement, ESEM, pp. 1-14, (2010)
[7]  
(2010)