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

Authors:
Arnaud Legrand;Alan Su;Frederic Vivien
Affiliations:
Laboratoire ID-IMAG, France;LIP, ENS Lyon, France;INRIA - LIP, ENS Lyon, France
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Year:
2005

Citing 4
Cited 1

Flow and stretch metrics for scheduling continuous job streams

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Parallelization of local BLAST service on workstation clusters

Future Generation Computer Systems

Minimizing the stretch when scheduling flows of divisible requests

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.