Online scheduling of parallel jobs on hypercubes: maximizing the throughput

Authors:
Ondřej Zajíček;Jiří Sgall;Tomáš Ebenlendr
Affiliations:
Institute of Mathematics, AS CR, Praha 1, Czech Republic;Dept. of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha 1, Czech Republic;Institute of Mathematics, AS CR, Praha 1, Czech Republic
Venue:
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Year:
2009

Citing 3
Cited 0

A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness

Journal of Scheduling
Maximizing the throughput of parallel jobs on hypercubes

Information Processing Letters
Finding total unimodularity in optimization problems solved by linear programs

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the online problem of scheduling unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive.