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.
Liste complète des métadonnées

https://hal.inria.fr/hal-00789443
Contributor : Arnaud Legrand <>
Submitted on : Monday, February 18, 2013 - 11:51:34 AM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM

Links full text

Identifiers

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, ⟨10.1109/IPDPS.2005.301⟩. ⟨hal-00789443⟩

Share

Metrics

Record views

224