Communication Dans Un Congrès Année : 2025

Green Scheduling on the Edge

Résumé

This work aims at designing and evaluating scheduling algorithms that minimize carbon cost on edge platforms. When a job is released to some edge server, difficult scheduling questions arise: should the job be executed on that server? If yes, when? If no, which other edge server should the job be transferred to? Typically, jobs are submitted online, and have a deadline to enforce. Online scheduling problems are already difficult without accounting for different energy sources, so one should not expect any optimal solution. Still, an important research goal is to revisit standard algorithms such as Earliest Completion Time (ECT) and Earliest Deadline First (EDF) in order to design and evaluate carbon-aware variants. This paper introduces several new algorithms that use sophisticated scheduling policies to efficiently decrease carbon cost; these algorithms maximize the use of green energy both on local and remote edge servers, by re-evaluating previous decisions whenever needed to accommodate newly released jobs. We provide a comprehensive simulation campaign based on actual platform/job data and carbon traces and report an average gain of 42% over standard approaches.

Fichier principal
Vignette du fichier
europar.pdf (909.55 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05224558 , version 1 (26-08-2025)

Licence

Identifiants

Citer

Joachim Cendrier, Rajini Wijayawardana, Anne Benoit, Yves Robert, Frédéric Vivien, et al.. Green Scheduling on the Edge. Euro-Par 2025 - 31st International European Conference on Parallel and Distributed Computing, Aug 2025, Dresden, Germany. pp.380-394, ⟨10.1007/978-3-031-99854-6_26⟩. ⟨hal-05224558⟩
372 Consultations
296 Téléchargements

Altmetric

Partager

  • More