Infrastructure · Data Structures
Parallel
Concurrent flow
Definition
Mechanism
Concurrent execution of two or more branches under no ordering guarantee: a caller may not assume which branch runs, finishes, or observes state first. Genuine simultaneity and interleaving both satisfy it — the pattern is the contract, not the substrate.
Invariants
- No result may depend on the order branches were entered or completed. A branch set with an order requirement is a Chain.
- Each declared branch is attempted. How outcomes combine is `join_semantics` and varies.
Risks
Failure modes
None stated.
Relationships
Builds on
References
Sequential data container (linked list)
Used by
References
Mind
Structural limit on parallel execution (Fan-out)
Society
High-velocity solver requiring parallel runtime
Mind
Run subtasks simultaneously and aggregate
Reference
Data schema
{
"type": "object",
"description": "A parallel topology — independent branches executed concurrently with a join point.",
"properties": {
"branches": {
"type": "array",
"description": "Independent execution branches"
},
"join_semantics": {
"type": "string",
"enum": [
"all",
"any",
"quorum"
],
"description": "How branch results combine"
}
},
"required": [
"branches"
]
}