Replication in Graph Partitioning and Scheduling Problems
arXiv 2605.00209•b427a7a2b01980de36d1ee67685b4307dde72857067e858fdec74504d65bc0a3
AIE-MLDAG-schedulingGEMMGPU-clustersIPUKV-cacheLLM-Emu','serving-emulation','profile-driven-sampling' , 'emulatLLM-servingMixture-of-ExpertsMoEPopdistPoplar-SDKSAGATempusVersal-AI-Edgeapproximation-complexitycomputational-fluid-dynamicsedge-inferenceexpert-placementgraph-partitioninginteger-linear-programmingreplicationsatellite-constellationspace-data-centersworkflow-scheduling
Paper metadata
- arXiv ID
- 2605.00209
- Version
- Not specified by this published record
- Category
- Computer Science — Distributed, Parallel, and Cluster Computing (cs.DC)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_dc
- Record identifier
- b427a7a2b01980de36d1ee67685b4307dde72857067e858fdec74504d65bc0a3
- Enrichment time
- 2026-05-04T08:52:21Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.