Trilemma: Recursive tasks, concurrency cap, no deadlock in XL agentic systems
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
CocoIndex describes a rule for task trees under a concurrency cap: a waiting parent lends its slot to one child at a time, which avoids deadlock and keeps in-flight tasks at most cap times tree depth. It says releasing the slot at the first child, its approach through 1.0.25, let an indexer reach about 15,000 file components in flight and run out of memory. In its own 2,000-file benchmark with a cap of 16, in-flight components fell from over 1,100 to 16.