Coordination and Productivity Issues in Free Software: the Role of Brooks' Law

被引:12
作者
Adams, Paul J.
Capiluppi, Andrea
Boldyreff, Cornelia
机构
来源
2009 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, CONFERENCE PROCEEDINGS | 2009年
关键词
EVOLUTION;
D O I
10.1109/ICSM.2009.5306308
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Proponents of the Free Software paradigm have argued that some of the most established software engineering principles do not fully apply when considered in an open, distributed approach found in Free Software development. The objective of this research is to empirically examine the Brooks' Law in a Free Software context. The principle is separated out into its two primary premises: the first is based on a developer's ability to become productive when joining a new team; the second premise relates to the quality of coordination as the team grows. Three large projects are studied for this purpose: KDE, Plone and Evince. Based on empirical evidence, the paper provides two main contributions: based on the first premise of Brooks' Law, it claims that coordination costs increase only in a very specific phase for Free Software projects. After that, these costs become quasi-constant. Secondly, it shows that a ramp up period exists in Free Software projects, and this period marks the divide between projects that are successful at engaging new contributors from others that only benefit from occasional new contributors.
引用
收藏
页码:319 / 328
页数:10
相关论文
共 34 条
[1]   Bridging the gap between agile and free software approaches: The impact of sprinting [J].
Adams, Paul J. ;
Capiluppi, Andrea .
International Journal of Open Source Software and Processes, 2009, 1 (01) :58-71
[2]  
[Anonymous], 1999, CATHEDRAL BAZAAR
[3]   Why Open Source software can succeed [J].
Bonaccorsi, A ;
Rossi, C .
RESEARCH POLICY, 2003, 32 (07) :1243-1258
[4]  
Brooks FP., 1995, The mythical man-month
[5]   Models for the evolution of OS projects [J].
Capiluppi, A .
INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, PROCEEDINGS, 2003, :65-74
[6]  
CAPILUPPI A, 2007, IWPSE 07, P79
[7]  
CAPRA E, 2008, OPEN SOURCE DEV COMM, P114
[8]  
CONWAY ME, 1968, DATAMATION, V14, P28
[9]  
Crowston K., 2004, P ACM WORKSH INT SOF
[10]   ALGORITHM-97 - SHORTEST PATH [J].
FLOYD, RW .
COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345