Accelerator clusters generate bursty network traffic: distributed training exchanges gradients via all-reduce, inference pipelines fan out requests, and storage competes with latency-sensitive RPCs. Poor placement amplifies congestion: a mis-scheduled training job can raise ECN mark rates by 3× and inflate co-located service tail latencies by 40%. Yet schedulers ignore real-time fabric state. We present Aegis, a scheduler that adapts placement using live fabric telemetry under operator-defined contracts. Aegis ingests per-ToR queue depths and ECN counters at 1-second granularity, incorporates a congestion-pressure term into placement scoring, and evolves online via a conservative bandit with exposure control. Contracts on tail latency, fairness, and congestion compile into safety envelopes that gate rollouts and trigger automatic rollback. We evaluate Aegis on an 80-node cluster (160 A100-80GB GPUs, 160 TPU v4 chips, 2-tier Clos fabric). Under production-derived workloads, Aegis reduces service p99 RPC latency by 27.3% (152.4 ms vs. 209.6 ms), cuts SLO violations by 3.6×, and lowers ECN mark rate by 51% while improving utilization from 68.4% to 79.1%. These gains hold under workload shifts and telemetry delays up to 60 seconds. The design is scoped to shared clusters where placement can materially reshape fabric contention.
Rui Li, Shuang Cao· Proceedings of the ACM SIGCO...· 0 citations
Repository-level code repair generates rich tool traces, but most LLM agents discard this data and keep restarting from a fixed debugging loop. We present Evolutionary Self-Debugging Agents (ESDA), which mines tool traces into structured failure signatures and uses them to maintain a strategy bank of reusable debugging policies. Policies are stored as modular prompt genomes with typed slots, enabling slot-level reuse, mutation, and crossover as new tasks arrive. A cost-aware ranking objective prioritizes strategies that are likely to succeed in the first few evaluator calls under tight budgets. On RepoBench, ESDA solves 58.4% of tasks within the first two evaluator calls and reduces median wall-clock time by 3.0x compared to strong baselines. We further analyze transfer across languages and build systems and find that mining failure signatures yields consistent gains under distribution shift.
Shuang Cao, Rui Li· Proceedings of the 32nd ACM...· 0 citations