Off-line scheduling of divisible requests on an heterogeneous collection of databanks

Arnaud Legrand 1 Alan Su 1 Frédéric Vivien 1
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. We show that this problem lies in the divisible load framework. In this framework, we propose a polynomial-time algorithm to solve the maximum weighted flow off-line scheduling problem on unrelated machines. We also show how to solve the maximum weighted flow off-line scheduling problem with preemption on unrelated machines.
Type de document :
Rapport
[Research Report] RR-5386, INRIA. 2004, pp.13
Liste complète des métadonnées


https://hal.inria.fr/inria-00070617
Contributeur : Rapport de Recherche Inria <>
Soumis le : vendredi 19 mai 2006 - 21:01:38
Dernière modification le : samedi 17 septembre 2016 - 01:27:40
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:35:08

Fichiers

Identifiants

  • HAL Id : inria-00070617, version 1

Collections

Citation

Arnaud Legrand, Alan Su, Frédéric Vivien. Off-line scheduling of divisible requests on an heterogeneous collection of databanks. [Research Report] RR-5386, INRIA. 2004, pp.13. <inria-00070617>

Partager

Métriques

Consultations de
la notice

185

Téléchargements du document

100