Afficher la notice abrégée

Energy-aware checkpointing of divisible tasks with soft or hard deadlines

hal.structure.identifierLaboratoire de l'Informatique du Parallélisme [LIP]
hal.structure.identifierOptimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
dc.contributor.authorAUPY, Guillaume
hal.structure.identifierLaboratoire de l'Informatique du Parallélisme [LIP]
hal.structure.identifierOptimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
dc.contributor.authorBENOIT, Anne
hal.structure.identifierDepartment of Computer Science - University of Pittsburgh
dc.contributor.authorMELHEM, Rami
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorRENAUD-GOUD, Paul
hal.structure.identifierLaboratoire de l'Informatique du Parallélisme [LIP]
hal.structure.identifierOptimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
dc.contributor.authorROBERT, Yves
dc.date.accessioned2024-04-15T09:43:06Z
dc.date.available2024-04-15T09:43:06Z
dc.date.created2013-02-01
dc.date.issued2013-02-01
dc.date.conference2013-06-27
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/197737
dc.description.abstractEnIn this paper, we aim at minimizing the energy consumption when executing a divisible workload under a bound on the total execution time, while resilience is provided through checkpointing. We discuss several variants of this multi-criteria problem. Given the workload, we need to decide how many chunks to use, what are the sizes of these chunks, and at which speed each chunk is executed. Furthermore, since a failure may occur during the execution of a chunk, we also need to decide at which speed a chunk should be re-executed in the event of a failure. The goal is to minimize the expectation of the total energy consumption, while enforcing a deadline on the execution time, that should be met either in expectation (soft deadline), or in the worst case (hard deadline). For each problem instance, we propose either an exact solution, or a function that can be optimized numerically.
dc.description.sponsorshipRésilience des applications scientifiques sur machines exascales - ANR-10-BLAN-0301
dc.language.isoen
dc.title.enEnergy-aware checkpointing of divisible tasks with soft or hard deadlines
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleIGCC - 4th International Green Computing Conference - 2013
bordeaux.countryUS
bordeaux.conference.cityArlington
bordeaux.peerReviewedoui
hal.identifierhal-00857244
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2013-06-29
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00857244v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2013-02-01&rft.au=AUPY,%20Guillaume&BENOIT,%20Anne&MELHEM,%20Rami&RENAUD-GOUD,%20Paul&ROBERT,%20Yves&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée