The upper bound of information diffusion in code review
Background: Code review, the discussion around a code change among humans, forms a communication network that enables its participants to exchange and spread information. Although reported by qualitative studies, our understanding of the capability of code review as a communication network is still limited.
Objective: In this article, we report on a first step towards understanding and evaluating the capability of code review as a communication network by quantifying how fast and how far information can spread through code review: the upper bound of information diffusion in code review.
Method: In an in-silico experiment, we simulate an artificial information diffusion within large (Microsoft), mid-sized (Spotify), and small code review systems (Trivago) modelled as communication networks. We then measure the minimal topological and temporal distances between the participants to quantify how far and how fast information can spread in code review.
Results: An average code review participants in the small and mid-sized code review systems can spread information to between 72% and 85% of all code review participants within four weeks independently of network size and tooling; for the large code review systems, we found an absolute boundary of about 11000 reachable participants. On average (median), information can spread between two participants in code review in less than five hops and less than five days.
Conclusion: We found evidence that the communication network emerging from code review scales well and spreads information fast and broadly, corroborating the findings of prior qualitative work. The study lays the foundation for understanding and improving code review as a communication network.
Thu 24 OctDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
14:00 - 15:30 | Repository miningESEM Journal-First Papers / ESEM IGC / ESEM Technical Papers at Multimedia (B3 Building - Hall) Chair(s): Apostolos Ampatzoglou University of Macedonia | ||
14:00 20mFull-paper | Decoding Android Permissions: A Study of Developer Challenges and Solutions on Stack Overflow ESEM Technical Papers Sahrima Jannat Oishwee University of Saskatchewan, Zadia Codabux University of Saskatchewan, Natalia Stakhanova University of Saskatchewan | ||
14:20 20mFull-paper | Negative Results of Image Processing for Identifying Duplicate Questions on Stack Overflow ESEM Technical Papers | ||
14:40 20mFull-paper | Understanding Fairness in Software Engineering: Insights from Stack Exchange Sites ESEM Technical Papers Emeralda Sesari University of Groningen, Federica Sarro University College London, Ayushi Rastogi University of Groningen, The Netherlands DOI Pre-print | ||
15:00 15mIndustry talk | Reducing Events to Augment Log-based Anomaly Detection Models: An Empirical Study ESEM IGC Lingzhe Zhang Peking University, China, Tong Jia Institute for Artificial Intelligence, Peking University, Beijing, China, Kangjin Wang Alibaba Group, Mengxi Jia Peking University, Yong Yang , Ying Li School of Software and Microelectronics, Peking University, Beijing, China | ||
15:15 15mJournal Early-Feedback | The upper bound of information diffusion in code review ESEM Journal-First Papers Michael Dorner Blekinge Institute of Technology, Daniel Mendez Blekinge Institute of Technology and fortiss, Krzysztof Wnuk , Ehsan Zabardast Blekinge Institute of Technology, Jacek Czerwonka Developer Services, Microsoft Link to publication DOI Pre-print |