@inbook{da56150da17b41af8b33c8fdec094878,
title = "Online scheduling of splittable tasks in peer-to-peer networks",
abstract = "We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independently. We consider both the case where the machines are identical and the case where some subset of the machines have a (fixed) higher speed than the others. We design a class of algorithms which allows us to give tight bounds for a large class of cases where tasks may be split into relatively many parts. For identical machines we also improve upon the natural greedy algorithm in other classes of cases.",
author = "Leah Epstein and {Van Stee}, Rob",
year = "2004",
doi = "10.1007/978-3-540-27810-8_35",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "408--419",
editor = "Torben Hagerup and Jyrki Katajainen",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}