Scheduling file transfers

Scheduling file transfers

We consider a problem of scheduling file transfers in a network so as to minimize overall finishing time. Although the general problem is NP-complete, we identify polynomial time solvable special cases and derive good performance bounds for several natural approximation algorithms, assuming the exis...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 1985-08, Vol.14 (3), p.744-780
Hauptverfasser: COFFMAN, E. G. JR, GAREY, M. R, JOHNSON, D. S, LAPAUGH, A. S
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Approximation
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Job shops
Laboratories
Schedules
Scheduling
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a problem of scheduling file transfers in a network so as to minimize overall finishing time. Although the general problem is NP-complete, we identify polynomial time solvable special cases and derive good performance bounds for several natural approximation algorithms, assuming the existence of a central controller. We also show how these bounds can be maintained in a distributed regime.
ISSN:0097-5397
1095-7111
DOI:10.1137/0214054