A note on scheduling parallel unit jobs on hypercubes

0334962 - MÚ 2010 RIV SG eng J - Journal Article
Zajíček, Ondřej
A note on scheduling parallel unit jobs on hypercubes.
[O rozvrhování paralelních úloh na hyperkrychlích.]
International Journal of Foundations of Computer Science. Roč. 20, č. 2 (2009), s. 341-349. ISSN 0129-0541. E-ISSN 1793-6373
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : scheduling * deadline * dynamic programming
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.512, year: 2009

We study the problem of scheduling in independent 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. Jobs' intervals of feasibility have to be nested. We provide an polynomial time algorithm for the problem.

Analyzujeme algoritmy pro rozvrhování paralelních úloh na hyperkrychlích.
Permanent Link: http://hdl.handle.net/11104/0179566