Result: Online deadline scheduling: Team adversary and restart

Title:
Online deadline scheduling: Team adversary and restart
Authors:
LEE, Jae-Ha
Source:
Approximation and online algorithms (Budapest, 16-18 September 2003, revised papers)Lecture notes in computer science. :206-213
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, 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, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Algorithme compétitif, Competitive algorithms, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Approche déterministe, Deterministic approach, Enfoque determinista, Compétitivité, Competitiveness, Competitividad, En ligne, On line, En línea, Longueur, Length, Longitud, Machine unique, Single machine, Máquina única, Ordonnancement, Scheduling, Reglamento, Retard, Delay, Retraso, Date limite, Deadline, Fechas últimas
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Engineering Department, Konkuk University, Korea, Republic of
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15735223
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.15735223
Database:
PASCAL Archive

Further Information

We study the competitiveness of online deadline scheduling problems. It is assumed that jobs are non-preemptive and we want to maximize, in an online manner, the sum of the length of jobs completed before their deadlines. When there is a single machine, Goldwasser [4] showed that the optimal deterministic competitiveness of this problem is 2 + 1/k, where each job of length L can be delayed for at least k . L before it is started, while still meeting its deadline. In this paper we generalize the framework of the above problem in two ways: First we replace the adversary by a set of m weak adversaries, each of which can generate arbitrary jobs that never overlap each other. Assuming that job sequence is generated by the team of m weak adversaries for some fixed m, we present a tight analysis of an optimal online algorithm by extending the previous analysis by Goldwasser. Next we allow online algorithms to abort the currently running job and to restart it from the scratch, if it can meet the deadline. This capability of abort and restart is different from preemptiveness because only jobs that are scheduled without interrupt are regarded to be successfully scheduled. We present a constant competitive algorithm for this model.