-
Notifications
You must be signed in to change notification settings - Fork 0
Architecture Scheduler
Devrajsinh Gohil edited this page Aug 30, 2026
·
1 revision
AgentMesh uses a priority-aware, lock-free ready queue combined with atomic dependency tracking.
Tasks are scheduled using a compound ordering key:
- Priority (DESC): Higher numerical priority executes first.
- Enqueue Timestamp (FIFO): Deterministic tie-breaking for equal priority tasks.
struct QueueComparator {
bool operator()(const TaskItem& a, const TaskItem& b) const noexcept {
if (a.priority != b.priority) {
return a.priority < b.priority; // max-heap
}
return a.enqueueTime > b.enqueueTime; // FIFO
}
};When a task completes, the scheduler decrements the in-degree of all dependent successor nodes. When in-degree reaches 0, the node is pushed to the ready queue in
Getting Started
How-To Guides
- Compile a Graph
- Annotated Reducers
- Parallel Fanout
- Send() Map-Reduce
- Command() Routing
- Nested Subgraphs
- Async & Streaming
- Checkpointing & State
- Financial Swarm Example
Architecture
- System Overview
- C++ Engine Internals
- O(1) Scheduler
- Dual-Tier Graph
- Persistence & WAL
- Zero-Copy Pybind Bridge
- SOLID Design Principles
API Reference
Benchmarks
Contributing