A Distributed Algorithm for Optimal Concurrent Communication and Load Balancing in Parallel Systems

We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applications in computer science and operations research. As an example, it can be used for determining optimal task migration paths in metacomputing environments, or for work-load balancing in arbitrary heterogeneous computer networks.

• Type: Conference
• Year: 1997
• Where: HPCN
• Authors: Uwe Dralle, Alexander Reinefeld
• Keywords: Concurrent Communication Ow, Distributed And Parallel Computing, HPCN 1997, Network Ow Applications, Optimal Task Migration