Diamond Agent: Agentic Control of Federated HPC Resources as a Service
Organizations: Rutgers University · University of Rochester · National Center for Supercomputing Applications · University of Chicago ·
Abstract
Efficiently aggregating and orchestrating computing power across heterogeneous clusters for HPC workflows faces four practical challenges: preserving workflow context across independently administered clusters, moving large datasets between sites, reasoning about site-specific environments and scheduler policies, and exploiting live queue and resource states for efficient task scheduling. To this end, we design Diamond Agent, an agentic system that enables intelligent execution of HPC workflows across heterogeneous clusters with typed skills as the interface. Diamond Agent provides an agent-facing workspace and skills that unify cross-site resource discovery, resource specification, data movement, task execution, and result retrieval. A centralized Diamond Agent instance can operate multiple supercomputers without being deployed separately on each login node. Diamond Agent translates high-level agent actions into valid site-specific executions, moves data through Globus Transfer, and uses live system capability and queue information to select feasible placements. Its event-driven continuation mechanism decouples agent actions from long-running batch jobs: persistent services monitor remote execution and resume the agent only when a result or decision-relevant event is available. We experiment with 27 hours of telemetry and 19 matched multi-site submission rounds comprising 83 jobs across four production supercomputers. Compared with a fixed-site baseline, Diamond Agent reduces the median additional completion time relative to the fastest observed placement from 42 seconds to 4 seconds, a 10.5x reduction.
Figures & tables
| Operation | Agent intent | Immediate response | Later trigger condition |
|---|---|---|---|
| inspect_federation | Observe systems, queues, capacity, health, and credit scope | Timestamped normalized snapshot | None |
| draft_envelope | Convert a task description into auditable resource bounds and constraints | Typed draft, rationale, confidence, validation result | None |
| submit_task | Execute one scientific or engineering action | Task handle, selected placement, granted shape, decision trace | Completion, failure, unresolved policy event, or requested milestone |
| submit_group | Fan out related tasks while preserving one objective | Group and child handles, placements, round state | Round terminal, stalled child, or group exception |
| move_data | Stage or replicate large inputs and outputs across sites | Transfer handle, source and destination references, policy trace | Transfer completion, failure, or requested milestone |
| get_result | Perceive outputs and provenance | Result manifest, attempt history, selected metadata | None |
| System | Arch. | Accelerators | Partitions / access |
|---|---|---|---|
| Delta@NCSA | x86_64 | A100 40G, A40 48G | 3, multi-user endpoint |
| DeltaAI@NCSA | aarch64 | GH200 120G, 4/node | 1, login-node endpoint |
| Anvil@RCAC | x86_64 | A100 40G, H100 80G | 2, login-node endpoint |
| Vista@TACC | aarch64 | GH200 96G, 1/node | 3, login-node endpoint |
| Workload | AI envelope | Selected shape | Actual completion | Observed implication |
|---|---|---|---|---|
| CPU preparation | 4–64 CPUs 2–8 GB no GPU | 64 CPUs 2 GB | 42 s; minimum 4-CPU shape: 226 s; 128-CPU probe: 2029 s | 64 CPUs reduced runtime without a queue penalty. 128 CPUs still scaled in-kernel but waited 2012 s, so the AI upper bound was conservative for scaling and appropriate for completion. |
| Single-GPU inference | 1 GPU 2–16 CPUs 16–64 GB | 1 GPU 16 CPUs 16 GB | 146 s; minimum 2-CPU shape: 148 s | GPU utilization and runtime were unchanged across the tested CPU range, so the upper CPU bound provided no completion benefit and should be refined by later profiling. |
| DDP training | 1–4 GPUs 4–32 CPUs 16–128 GB | 4 GPUs 32 CPUs 16 GB | 345 s; 1 GPU: 58 s; 2-GPU probe: 55 s | The 1 2 4 GPU speedups were 1.90 and 1.96 per doubling, so 4 GPUs passed the usefulness threshold, but its longer queue wait made 1–2 GPUs better for end-to-end completion. |
| Policy | Fastest selected | Median | Mean | Mean wait | Median additional completion time | P95 additional completion time |
|---|---|---|---|---|---|---|
| Fixed Delta | 0% | 227s | 1422s | 1198s | 42s | 5873s |
| Shortest feasible queue | 47% | 322s | 738s | 513s | 4s | 3000s |
| Best-feasible | 47% | 196s | 817s | 592s | 4s | 3000s |
| Fastest observed placement | 100% | 194s | 281s | 57s | 0s | 0s |
| Agent | Remote job | Async interval | Status calls | 5-min polls |
|---|---|---|---|---|
| Claude Code | Delta, A40 | 37 min | 0 | 8 |
| Codex | DeltaAI, GH200 | 84 min | 0 | 17 |
High-Performance Computing
High-performance computing (HPC) uses parallel systems and optimized software to solve computationally demanding scientific and engineering problems.
See all 143 papers