Algorithmic Interactions in Open Source Work
研究了开源工作中算法如何相互协作，以Linux内核为例，揭示了算法通过管理、组织和监督开发过程来弥补模块化和并行开发的不足，对开源学者理解算法与开发者之间的双向增强关系有帮助。
This study focuses on algorithmic interactions in open source work. Algorithms are essential in open source because they remedy concerns incompletely addressed by parallel development or modularity. Following algorithmic interactions in open source allows us to map the operational performance of algorithms to understand how algorithms work with multiple other algorithms to accomplish work. Studying algorithms working together shows us how residual interdependencies of modularity and problems not resolved by dependence on parallel development are worked around to perform open source work. We examine the Linux Kernel case that reveals how algorithmic interactions facilitate open source work through the three processes of managing, organizing, and supervising development work. Our qualitative study theorizes how algorithmic interactions intensify through these processes that work together to facilitate development. We make a theoretical contribution to open source scholarship by explaining how algorithmic interactions navigate across module rigidity and enhance parallel development. Our work also reveals how, in open source, developers work to automate most tasks and augmentation is a bidirectional relationship of algorithms augmenting the work of developers and of developers augmenting the work of algorithms.