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

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.
Document type :
Reports
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070617
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:01:38 PM
Last modification on : Monday, October 21, 2019 - 4:11:17 PM

Identifiers

  • 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, LIP RR-2004-51, INRIA,LIP. 2004, pp.13. ⟨inria-00070617⟩

Share

Metrics

Record views

369

Files downloads

376