arXiv (All)
open access
TFR-GNN: Topology- and Fault-Aware Graph Neural Scheduling for Heterogeneous Distributed Computing Systems
Scheduling workflow directed acyclic graphs (DAGs) on heterogeneous distributed systems is a classical NP-hard problem, and the list-scheduling heuristic HEFT remains the defacto standard because of its low complexity and strong makespan. In real deployments, however, machines fail: commodity and pr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- SAGA: Workflow-Atomic Scheduling for AI Agent Inference on GPU Clusters#151760
- Agentic CPU-GPU Scheduling for Heterogeneous AI Workloads#405626
- HOCCL: Offloading Collective Communication from GPU Cores to Accelerate Distributed Training#1119407
- HOCCL: Offloading Collective Communication from GPU Cores to Accelerate Distributed Training#1108656
- Physics-Aware Random Walk Fingerprints for Scalable Power Grid Graph Classification#971910
Record · ID 986938
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive