Minimizing the stretch when scheduling flows of biological requests - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Minimizing the stretch when scheduling flows of biological requests

Abstract

In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed in this model. We first explain the relationship between this model and the preemptive uni-processor one. After having selected a few relevant metrics (max-stretch and sum-stretch), we show how to extend algorithms that have been proposed in the literature for the uni-processor model to our setting. Then we extensively study the performance of these algorithms in realistic scenarios. Our study clearly suggest an efficient heuristic for each of the two metrics, though a combined optimization is in theory not possible in the general case.
Fichier principal
Vignette du fichier
RR-5724.pdf (298.38 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070293 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070293 , version 1

Cite

Arnaud Legrand, Alan Su, Frédéric Vivien. Minimizing the stretch when scheduling flows of biological requests. [Research Report] RR-5724, INRIA. 2005, pp.22. ⟨inria-00070293⟩
99 View
157 Download

Share

Gmail Facebook X LinkedIn More