|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 187 - Issue 93 |
| Published: March 2026 |
| Authors: Umamaheswara Rao Kukkala |
10.5120/ijca2026926599
|
Umamaheswara Rao Kukkala . Experimental Study of shared-task-list Agent Teams and Hierarchical Subagents for end-to-end code Synthesis. International Journal of Computer Applications. 187, 93 (March 2026), 8-20. DOI=10.5120/ijca2026926599
@article{ 10.5120/ijca2026926599,
author = { Umamaheswara Rao Kukkala },
title = { Experimental Study of shared-task-list Agent Teams and Hierarchical Subagents for end-to-end code Synthesis },
journal = { International Journal of Computer Applications },
year = { 2026 },
volume = { 187 },
number = { 93 },
pages = { 8-20 },
doi = { 10.5120/ijca2026926599 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2026
%A Umamaheswara Rao Kukkala
%T Experimental Study of shared-task-list Agent Teams and Hierarchical Subagents for end-to-end code Synthesis%T
%J International Journal of Computer Applications
%V 187
%N 93
%P 8-20
%R 10.5120/ijca2026926599
%I Foundation of Computer Science (FCS), NY, USA
Large language models (LLMs) are increasingly being deployed as autonomous software engineering agents capable of decomposing tasks, generating code, and iteratively refining solutions. However, the impact of coordination architecture on system performance remains underexplored. This study presents a controlled empirical comparison between hierarchical subagent delegation and collaborative shared-task-list agent teams for end-to-end code synthesis. Using SWE-bench Verified tasks and integration-heavy repository builds, this study evaluates the solve rate, regression stability, token cost, and coordination overhead across varying dependency coupling regimes. The results show that collaborative agent teams achieve up to 17% higher solve rates in moderately coupled tasks and reduce regression errors by 25% but incur up to 2.9× higher token cost. Performance gains diminish in highly coupled scenarios due to coordination overhead. This study introduces a coupling-sensitive coordination framework that explains these trade-offs and provides a principled basis for selecting orchestration strategies. These findings contribute to the design of efficient multi-agent LLM systems and advance the understanding of coordination dynamics in autonomous software engineering.