The buffer minimization problem for multiprocessor scheduling with conflicts.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F01%3A05025170" target="_blank" >RIV/67985840:_____/01:05025170 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The buffer minimization problem for multiprocessor scheduling with conflicts.
Original language description
Our objective is to schedule task execution, obeying the conflict constraints, and minimizing the maximum buffer size of all processors. In the on-line case, we provide the following results: (i) a competitive algorithm for general graphs, (ii) tight bounds on the competitive ratios for cliques and complete $k$-partite graphs, and (iii) a $(Delta/2+1)$-competitive algorithm for trees, where $Delta$ is the diameter.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
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
2001
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
Proceedings of the 28th International Colloquium on Automata, Languages, and Programming.
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
862-874
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Crete [GR]
Event date
Jul 8, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—