loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1
Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks
Denver, Colorado
April 04-April 08
ISBN: 0-7695-2312-9
ASCII Text
x 
 
Arnaud Legrand, Alan Su, Fr?d?ric Vivien, "Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks," Parallel and Distributed Processing Symposium, International, vol. 2, pp. 123a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1, 2005.
 
 
BibTex
x
 
@article{ 10.1109/IPDPS.2005.301,
author = {Arnaud Legrand and Alan Su and Fr?d?ric Vivien},
title = {Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks},
journal ={Parallel and Distributed Processing Symposium, International},
volume = {2},
year = {2005},
issn = {1530-2075},
pages = {123a},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2005.301},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing Symposium, International
TI - Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks
SN - 1530-2075
SP
EP
A1 - Arnaud Legrand,
A1 - Alan Su,
A1 - Fr?d?ric Vivien,
PY - 2005
KW - null
VL - 2
JA - Parallel and Distributed Processing Symposium, International
ER -
 
Arnaud Legrand, Laboratoire ID-IMAG, France
Alan Su, LIP, ENS Lyon, France
Fr?d?ric Vivien, INRIA - LIP, ENS Lyon, France
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.
Citation:
Arnaud Legrand, Alan Su, Fr?d?ric Vivien, "Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks," ipdps, vol. 2, pp.123a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.