Treffer: Scheduling broadcasts with deadlines
Title:
Scheduling broadcasts with deadlines
Authors:
Source:
Selected Papers from COCOON 2003Theoretical computer science. 325(3):479-488
Publisher Information:
Amsterdam: Elsevier, 2004.
Publication Year:
2004
Physical Description:
print, 14 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, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme compétitif, Competitive algorithms, Algorithme en ligne, Online algorithm, Algoritmo en línea, Informatique théorique, Computer theory, Informática teórica, Ordonnancement, Scheduling, Reglamento, Radiodiffusion, Broadcasting, Radiodifusión, Temps attente, Waiting time, Tiempo espera, Algorithm en ligne
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Engineering, Pusan University of Foreign Studies, Pusan 608-738, Korea, Republic of
Department of Electrical Engineering Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Korea, Republic of
Department of Electrical Engineering Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Korea, Republic of
ISSN:
0304-3975
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.16145766
Database:
PASCAL Archive
Weitere Informationen
We investigate the problem of scheduling broadcasts in data delivering systems via broadcast, where a number of requests from several clients can be simultaneously satisfied by one broadcast of a server. Most of prior work has focused on minimizing the total flow time of requests. It assumes that once a request arrives, it will be held until satisfied. In this paper, we are concerned with the situation that clients may leave the system if their requests are still unsatisfied after waiting for some time, that is, each request has a deadline. The problem of maximizing the throughput, for example, the total number of satisfied requests, is developed, and there are given online algorithms achieving constant competitive ratios.