Result: Online competitive algorithms for maximizing weighted throughput of unit jobs

Title:
Online competitive algorithms for maximizing weighted throughput of unit jobs
Authors:
BARTALL, Yair, CHIN, Francis Y. L, CHROBAK, Marek, FUNG, Stanley P. Y, JAWOR, Wojciech, LAVIL, Ron, SGALL, Jiri, TICHY, Tomas
Source:
STACS 2004 (Montpellier, 25-27 March 2004)Lecture notes in computer science. :187-198
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Généralités, General, Algorithme compétitif, Competitive algorithms, Algorithme déterministe, Deterministic algorithms, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Borne inférieure, Lower bound, Cota inferior, Capacité canal, Channel capacity, Capacidad canal, Charge travail, Workload, Carga trabajo, Gestion tâche, Task scheduling, Gestión labor, Informatique théorique, Computer theory, Informática teórica, Multiprocesseur, Multiprocessor, Multiprocesador, Plan randomisé, Randomized design, Plan aleatorizado, Date limite, Deadline, Fechas últimas
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute of Computer Science, The Hebrew University of Jerusalem, Israel
Department of Computer Science and Information Systems, The University of Hong Kong, Hong-Kong
Department of Computer Science, University of California, Riverside, CA 92521, United States
Mathematical Institute, AS CR, Žitná 25, 11567 Praha, Czech Republic
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15758517
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15758517
Database:
PASCAL Archive

Further Information

We study an online scheduling problem for unit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight. The goal is to maximize the weighted throughput, that is the total weight of scheduled jobs. We first give a randomized algorithm RMIX with competitive ratio of e/(e - 1) ~ 1.582. Then we consider s-bounded instances where the span of each job is at most s. We give a 1.25-competitive randomized algorithm for 2-bounded instances, and a deterministic algorithm EDFα, whose competitive ratio on s-bounded instances is at most 2 - 2/s + o(1/s). For 3-bounded instances its ratio is Φ ~ 1.618, matching the lower bound. We also consider 2-uniform instances, where the span of each job is 2. We prove a lower bounds for randomized algorithms and deterministic memoryless algorithms. Finally, we consider the multiprocessor case and give an 1/(1 - (M M+1)M)-competitive algorithm for M processors. We also show improved lower bounds for the general and 2-uniform cases.