On the Problem of Scheduling Flows on Distributed Networks

Authors:
Thomas Lücking;Burkhard Monien;Manuel Rode
Affiliations:
-;-;-
Venue:
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Year:
2002

Citing 6
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Efficient schemes for nearest neighbor load balancing

Parallel Computing - Special issue on parallelization techniques for numerical modelling
Diffusive load balancing schemes on heterogeneous networks

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Distributed Algorithms

Distributed Algorithms
Quality Balancing for Parallel Adaptive FEM

IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel

Distributed Jacobi joint diagonalization on clusters of personal computers

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling a given flow on a synchronous distributed network. This problem arises using diffusion-based approaches to compute a balancing flow, which has to be scheduled afterwards. We show that every distributed scheduling strategy requires at least 3/2 times the minimum number of rounds. Furthermore we give a distributed algorithm for flows on tree networks, which requires at most two times the optimal number of rounds.