Treffer: Online Scheduling of equal-length jobs: Randomization and restarts help
Title:
Online Scheduling of equal-length jobs: Randomization and restarts help
Authors:
Source:
Automata, languages and programming (Turku, 12-16 July 2004)Lecture notes in computer science. :358-370
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 15 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, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Algorithme compétitif, Competitive algorithms, Algorithme déterministe, Deterministic algorithms, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Automate, Automaton, Autómata, Borne inférieure, Lower bound, Cota inferior, Charge travail, Workload, Carga trabajo, Gestion tâche, Task scheduling, Gestión labor, Langage programmation, Programming language, Lenguaje programación, Machine unique, Single machine, Máquina única, Ordonnancement, Scheduling, Reglamento, Randomisation, Randomization, Aleatorización, Temps traitement, Processing time, Tiempo proceso, Date limite, Deadline, Fechas últimas
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of California, Riverside, CA 92521, United States
Mathematical Institute, AS CR, Žitná 25, 11567 Praha, Czech Republic
Mathematical Institute, AS CR, Žitná 25, 11567 Praha, Czech Republic
ISSN:
0302-9743
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
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.16126742
Database:
PASCAL Archive
Weitere Informationen
The input of the studied scheduling problem is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule that maximizes the number of completed jobs. In the online version, each job arrives at its release time. First, we give a barely random 5/3-competitive algorithm that uses only one random bit; we also show a lower bound of 3/2 for barely random algorithms that choose one of two deterministic algorithms. Second, we give a deterministic 3/2-competitive algorithm in the model that allows restarts, and we show that in this model the ratio 3/2 is optimal.