A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs
BEAUMONT, Olivier
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
LEGRAND, Arnaud
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
ROBERT, Yves
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
BEAUMONT, Olivier
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
LEGRAND, Arnaud
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
ROBERT, Yves
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
< Leer menos
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
Idioma
en
Rapport
Este ítem está publicado en
2002
Resumen en inglés
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different computation and communication ...Leer más >
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different computation and communication capabilities. We assume communication-computation overlap for each slave (and for the master), but the communication medium is exclusive: the master can only communicate with a single slave at each time-step. We give a polynomial-time algorithm to solve the following scheduling problem: given a time-bound T, what is the maximal number of tasks that can be processed by the master and the p slaves within T time-units?.< Leer menos
Orígen
Importado de HalCentros de investigación