Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

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 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.
No file

Dates and versions

hal-00789443 , version 1 (18-02-2013)

Identifiers

Cite

Arnaud Legrand, Alan Su, Frédéric Vivien. Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks. Proceedings of the 14th Heterogeneous Computing Workshop, 2005, Denver, Colorado, USA, ⟨10.1109/IPDPS.2005.301⟩. ⟨hal-00789443⟩
146 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More