Preemptive scheduling in overloaded systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003931" target="_blank" >RIV/00216208:11320/02:00003931 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Preemptive scheduling in overloaded systems
Original language description
We are given a set of tasks with release times, deadlines and profit rates. A task brings profit even if not completed. We present an efficient offline alg. and improve both the lower and upper bounds on the compet. ratio of online algorithms.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</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
2002
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
Proc. of the 29th International Colloquium on Automata, Languages and Programming
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
800-811
Publisher name
Springer-Verlag
Place of publication
SRN
Event location
SRN
Event date
Jan 1, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—