A Note on Scheduling Parallel Unit Jobs on Hypercubes. ITI Series 2008-418
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F08%3A00318811" target="_blank" >RIV/67985840:_____/08:00318811 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Note on Scheduling Parallel Unit Jobs on Hypercubes. ITI Series 2008-418
Original language description
We study the problem of scheduling 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.
Czech name
O rozvhování paralelních úloh na hyperkrychlích
Czech description
Analyzujeme algoritmy pro rozvrhování paralelních úloh na hyperkrychlích
Classification
Type
O - Miscellaneous
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA1019401" target="_blank" >IAA1019401: Theories, proofs and computational complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů