With fixed task mapping and ordering, minimizing carbon cost by shifting task start times is polynomial for one processor, NP-hard for multiple, and a new greedy+local-search framework approaches the ILP optimum.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint
With fixed task mapping and ordering, minimizing carbon cost by shifting task start times is polynomial for one processor, NP-hard for multiple, and a new greedy+local-search framework approaches the ILP optimum.