Scheduling divisible loads on star and tree networks: results and open problems

Olivier Beaumont 1, 2 Henri Casanova 3 Yang Yang 4 Yves Robert 5, 6
1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
INRIA Futurs, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
3 ICS Department - Department of Information and Computer Sciences
4 CSE-UCSD - Department of Computer Science and Engineering [San Diego]
5 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
6 LIP - Laboratoire de l'Informatique du Parallélisme
Document type :
Journal articles
Complete list of metadatas
https://hal.inria.fr/inria-00358949
Contributor : Olivier Beaumont <>
Submitted on : Thursday, February 5, 2009 - 8:03:48 AM
Last modification on : Saturday, April 21, 2018 - 1:27:07 AM

Identifiers

  • HAL Id : inria-00358949, version 1

Collections

INRIA | LABRI | LIP | UNIV-BORDEAUX | ENS-LYON | UNIV-LYON1

Citation

Olivier Beaumont, Henri Casanova, Yang Yang, Yves Robert. Scheduling divisible loads on star and tree networks: results and open problems. IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 2005. ⟨inria-00358949⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

212

Contact


archive-ouverte@inria.fr