Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10049881" target="_blank" >RIV/00216208:11320/10:10049881 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/10:00353476
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput
Original language description
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
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
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
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Parallel processing and applied mathematics, Part II
ISBN
978-3-642-14402-8
ISSN
0302-9743
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Wroclaw, Poland
Event date
Sep 13, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000282831500006