Contention-free scheduling in a dynamic context - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Contention-free scheduling in a dynamic context

Daniel Millot
  • Fonction : Auteur
  • PersonId : 865778
Christian Parrot
  • Fonction : Auteur
  • PersonId : 976924

Résumé

In this paper, we present an adaptive method for scheduling parallel applications on heterogeneous multi-processor platforms, in a dynamic context. When executing divisible load applications according to a master-worker model, this method delivers the workload through multiple rounds and can avoid contentions in the use of the network. Such contentions avoidance is a means to avoid idle time, thus to maximize the throughput. Before presenting the proposed scheduling method, the paper revisits a runtime method which motivated its development. The method presented in this paper can be used to schedule parallel applications whose total workload is large but unknown a priori. It can also handle the dynamic conditions of execution that are typical of grids
Fichier non déposé

Dates et versions

hal-01376401 , version 1 (04-10-2016)

Identifiants

Citer

Daniel Millot, Christian Parrot. Contention-free scheduling in a dynamic context. ICPADS 2008 : 14th IEEE International Conference on Parallel and Distributed Systems, Dec 2008, Melbourne, Australia. pp.19 - 26, ⟨10.1109/ICPADS.2008.23⟩. ⟨hal-01376401⟩
16 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More