Online competitive algorithms for maximizing weighted throughput of unit jobs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F04%3A00106816" target="_blank" >RIV/67985840:_____/04:00106816 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Online competitive algorithms for maximizing weighted throughput of unit jobs
Original language description
We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications, equivalently as an online scheduling problem for unit-lenght jobs, where each job is specified by its release time, deadline, and a nonnegative weight (QoS value). The goal is to maximize the /emph{weighted throughput}, that is total weight of scheduled jobs.
Czech name
Online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy
Czech description
Článek studuje online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy.
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
2004
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 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS)
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
187-198
Publisher name
SpringerVerlag
Place of publication
Berlin
Event location
Montpellier
Event date
Mar 25, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—