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.
['Arnaud Legrand', 'Alan Su', 'Frédéric Vivien']
Off-line scheduling of divisible requests on an heterogeneous collection of databanks