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

摘要

We present a distributed algorithm for determining optimal concurrent communication flow in arbitrary computer networks. Our scheme s appliable to a wide range of network flow 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 arbitary heterogeneous comptuer networks.