Recently, heterogeneous cluster systems are attracting attention as a high performance and cost-effective parallel computer. A broadcast schedule is important for a design of high performance clusters. Because it is difficult to find an optimal broadcast schedule for a heterogeneous cluster, many heuristic algorithms were proposed. However, most of these algorithms are designed only for a cluster of which network topology is a complete graph. In this paper, we propose a heuristic algorithm for a broadcast operation in a heterogeneous cluster of which network topology is not a complete graph. In addition, we show that this algorithm outputs a schedule in a time which is as well as, or better than a random search.
展开▼
