论文信息 - Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

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.

Jirí Sgall | Tomás Ebenlendr | Ondrej Zajícek

[1] Ondrej Zajícek. A Note on Scheduling Parallel Unit Jobs on Hypercubes , 2009, Int. J. Found. Comput. Sci..

[2] Philippe Baptiste,et al. A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness , 2003, J. Sched..

[3] Ond Rej Zaj I Cek. A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES , 2009 .

[4] Christoph Dürr,et al. Finding Total Unimodularity in Optimization Problems Solved by Linear Programs , 2006, ESA.

[5] Guochuan Zhang,et al. Maximizing the throughput of parallel jobs on hypercubes , 2007, Inf. Process. Lett..