Concurrency Report
Report concurrency and parallelism for a session, how many agents ran in parallel...
Install
npx skills add hoangsonww/Claude-Code-Agent-Monitor --skill concurrency-report -g -a claude-code -y- Repository
- hoangsonww/Claude-Code-Agent-Monitor1.1k
- Category
- AI and agents
- Updated
- 5d ago
- License
- MIT
- Context cost
- Lightabout 527 tokens
- Runs scripts
- No, instructions only
What it does
Report concurrency and parallelism for a session, how many agents ran in parallel, concurrency-lane utilization, peak parallel width, and serialization bottlenecks (sequential chains that could have run as parallel lanes), using the Agent Monitor workflow intelligence API. Use when checking whether a multi-agent session used parallelism efficiently.
Concurrency Report
Report on parallel execution for one Claude Code session: lanes, peak width, utilization, and where work serialized.
Input
The user provides: $ARGUMENTS
A session ID. If empty, fetch GET /api/sessions?limit=1 and report on the most recent session, stating which one.
Data Sources
| Endpoint | Returns |
|---|---|
GET /api/workflows/{sessionId} | The concurrency dataset (overlapping agent execution lanes with start/end timing) and the complexity dataset (numeric score from depth, breadth, and tool diversity) |
Report Sections
1. Parallelism Summary
From concurrency: number of distinct lanes, peak parallel width (max agents running simultaneously), and total agents. Pair with the complexity score to judge whether the parallelism matched the work's size.
Lanes: N · Peak parallel: M · Agents: K · Complexity: S
2. Lane Timeline
A per-lane list of the agents that occupied each lane in order:
Lane 1: explore (0, 12s) → code-review (12, 48s)
Lane 2: debugger (5, 30s)
Show overlapping windows so simultaneity is visible.
3. Utilization
| Lane | Busy time | Idle time | Utilization % |
|---|---|---|---|
| Plus an overall utilization figure (busy lane-time / total lane-time). |
4. Serialization Bottlenecks
Identify sequential chains where one agent waited on the previous despite no apparent dependency, candidates to run as parallel lanes. State the chain and the wall-clock time it cost. Only flag chains the concurrency timing data actually shows as sequential.
