The Sum-Bottleneck Path Algorithm

Abstract

In the preceding three chapters we have seen how maximum flow and shortest path algorithms can be used to find the optimal assignment of a serial distributed program. Recent research has shown that a sum-bottleneck path algorithm can be employed to find the optimal assignment of the modules of a parallel or pipelined program in several types of distributed systems. This approach can also be used to find the optimal global assignment of a set of independent serial distributed programs over a single-host, multiple-satellite system. Since this technique can explicitly take concurrency into account, it represents a major development over the work presented in the preceding chapters.