Metraipolis › archive › dc_01d74bd5bc93
HeteroTask: Multi-Variant Task Scheduling and Execution on Distributed Heterogeneous Clusters — arXiv:2611.10055
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.10055
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-10T18:45:40.141Z
- SHA-256 of the archived text
7f68c9fe13dd6aeb77d2ec82eda4764e4ff0ac3d822da2ef1d0592a2063d49cc- Stable URL of this page
https://metraipolis.com/documento/dc_01d74bd5bc93
How to cite
HeteroTask: Multi-Variant Task Scheduling and Execution on Distributed Heterogeneous Clusters — arXiv:2611.10055 — arXiv (en), https://arxiv.org/abs/2611.10055 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_01d74bd5bc93 (Metraipolis archive dc_01d74bd5bc93, sha256 7f68c9fe13dd6aeb77d2ec82eda4764e4ff0ac3d822da2ef1d0592a2063d49cc)
BibTeX
@misc{dc01d74bd5bc93,
title = {HeteroTask: Multi-Variant Task Scheduling and Execution on Distributed Heterogeneous Clusters — arXiv:2611.10055},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.10055},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_01d74bd5bc93; sha256 7f68c9fe13dd6aeb77d2ec82eda4764e4ff0ac3d822da2ef1d0592a2063d49cc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.10055. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Heterogeneous systems that combine CPUs and GPUs across multiple servers offer substantial compute capability but complicate scheduling. For DAG-based applications with multiple task implementations, effective execution requires coordinating variant selection, device placement, and data movement. Offline planning can exploit global dependency information, yet plans derived from isolated kernel profiles may diverge from execution because of runtime overheads. We introduce HeteroTask, a framework integrating kernel-wise profiling, PEFT-based multi-variant planning, host-buffer lifetime modeling, and schedule-driven MPI execution. A Bayesian-optimization loop calibrates empirical overhead corrections for repeated, fixed-DAG workflows on exclusively allocated nodes. We evaluate five benchmark and workflow-derived applications on up to six 8-GPU nodes. On two 8-GPU nodes, HeteroTask reduces application-level completion time by 19.7-72.1% relative to the compared StarPU implementations. For Canny Edge Detection, calibration reduces task-window makespan by 25.0% relative to planning without overhead corrections. Combined with CPU/GPU variant selection, calibration reduces it by 58.9% relative to an uncalibrated GPU-only execution. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2611.10055 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-10T18:38:07.438Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).