Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks

Arnaud Legrand 1 Alan Su 2, 3 Frédéric Vivien 2, 3
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 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 experimentally show that this problem lies in the divisible load framework with negligible communication costs. In this framework, we propose a polynomial-time algorithm to optimally solve the maximum weighted flow offline scheduling problem on unrelated machines. We also show how to optimally solve the maximum weighted flow off-line scheduling problem with preemption on unrelated machines.
Type de document :
Communication dans un congrès
Proceedings of the 14th Heterogeneous Computing Workshop, 2005, Denver, Colorado, USA, IEEE Computer Society Press, 2005, <10.1109/IPDPS.2005.301>
Liste complète des métadonnées

https://hal.inria.fr/hal-00789443
Contributeur : Arnaud Legrand <>
Soumis le : lundi 18 février 2013 - 11:51:34
Dernière modification le : mercredi 14 décembre 2016 - 01:09:20

Identifiants

Collections

Citation

Arnaud Legrand, Alan Su, Frédéric Vivien. Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks. Proceedings of the 14th Heterogeneous Computing Workshop, 2005, Denver, Colorado, USA, IEEE Computer Society Press, 2005, <10.1109/IPDPS.2005.301>. <hal-00789443>

Partager

Métriques

Consultations de la notice

123