Scheduling data transfers in a network and the set scheduling problem

Authors:
Ashish Goel;Monika R. Henzinger;Serge Plotkin;Eva Tardos
Affiliations:
Departments of Management Science and Engineering and (by courtesy) Computer Science, Stanford University, Stanford, CA;Google Inc., Mountain View;Department of Computer Science, Stanford University, Stanford, CA;Department of Computer Science, Cornell University, Ithaca, NY
Venue:
Journal of Algorithms
Year:
2003

Citing 23
Cited 3

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Call preemption in communication networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Randomized on-line scheduling of parallel jobs

Journal of Algorithms
Scheduling issues in multimedia query optimization

ACM Computing Surveys (CSUR)
Lower bounds for on-line graph problems with application to on-line circuit and optical routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Efficient on-line call control algorithms

Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
Approximating total flow time on parallel machines

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Scheduling data transfers in a network and the set scheduling problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Minimizing the flow time without migration

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

SIAM Journal on Computing
Scheduling to minimize average completion time: off-line and on-line algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On multi-dimensional packing problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Flow and stretch metrics for scheduling continuous job streams

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scheduling to minimize average stretch without migration

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for stretch scheduling

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Techniques for Average Completion Time Scheduling

SIAM Journal on Computing
Improved Scheduling Algorithms for Minsum Criteria

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Online Scheduling to Minimize Average Stretch

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Modeling Multicomputer Task Allocation as a Vector Packing Problem

ISSS '96 Proceedings of the 9th international symposium on System synthesis

Simulation and analysis of PDU traffic bundled under packet alloying

Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks

Journal of Parallel and Distributed Computing
Lowering Inter-datacenter Bandwidth Costs via Bulk Data Scheduling

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.