Abstract:

In a distributed application,the performance problem is coupled with the components deployment. Using the weighted graph and the k-partition in the graph theory, this paper presents a distributed components deployment algorithm that minimizes the components’ communication loads, and mainly designs a suboptimal algorithm for the distributed components deployment. A simple application of the suboptimal algorithm is presented  in the end.

Key words: distributed component；software architecture；component design；component deployment；graph partitioning