Minimizing the stretch when scheduling flows of divisible requests - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2006

Minimizing the stretch when scheduling flows of divisible requests

(1, 2) , (3) , (3, 4)
1
2
3
4

Abstract

In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed in this model. We discuss and select relevant metrics for this framework: namely max-stretch and sum-stretch. We explain the relationship between our model and the preemptive uni-processor case, and we show how to extend algorithms that have been proposed in the literature for the uni-processor model to the divisible multi-processor problem domain. We recall known results on closely related problems, we show how to minimize the max-stretch on unrelated machines either in the divisible load model or with preemption, we derive new lower bounds on the competitive ratio of any on-line algorithm, we present new competitiveness results for existing algorithms, and we develop several new on-line heuristics. We also address the Pareto optimization of max-stretch. Then, we extensively study the performance of these algorithms and heuristics in realistic scenarios. Our study shows that all previously proposed guaranteed heuristics for max-stretch for the uni-processor model prove to be inefficient in practice. In contrast, we show our on-line algorithms based on linear programming to be near-optimal solutions for max-stretch. Our study also clearly suggests heuristics that are efficient for both metrics, although a combined optimization is in theory not possible in the general case.
Fichier principal
Vignette du fichier
FinalRR.inria.pdf (748.89 Ko) Télécharger le fichier
Vignette du fichier
RR2006-19.pdf (893.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00108524 , version 1 (22-10-2006)
inria-00108524 , version 2 (24-10-2006)
inria-00108524 , version 3 (08-02-2008)

Identifiers

  • HAL Id : inria-00108524 , version 3

Cite

Arnaud Legrand, Alan Su, Frédéric Vivien. Minimizing the stretch when scheduling flows of divisible requests. [Research Report] RR-6002, LIP RR-2006-19, INRIA, LIP. 2006, pp.76. ⟨inria-00108524v3⟩
413 View
320 Download

Share

Gmail Facebook Twitter LinkedIn More