Number of the records: 1
A note on scheduling parallel unit jobs on hypercubes
- 1.
SYSNO ASEP 0334962 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title A note on scheduling parallel unit jobs on hypercubes Title O rozvrhování paralelních úloh na hyperkrychlích Author(s) Zajíček, Ondřej (MU-W) SAI Source Title International Journal of Foundations of Computer Science - ISSN 0129-0541
Roč. 20, č. 2 (2009), s. 341-349Number of pages 9 s. Language eng - English Country SG - Singapore Keywords scheduling ; deadline ; dynamic programming Subject RIV IN - Informatics, Computer Science R&D Projects 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) CEZ AV0Z10190503 - MU-W (2005-2011) UT WOS 000265086600008 Annotation 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. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2010
Number of the records: 1