Enhancing PC cluster-based parallel branch-and-bound algorithms for the graph coloring problem

被引：1

作者：

Taoka, Satoshi ^{[1
]}

Takafuji, Daisuke ^{[1
]}

Watanabe, Toshimasa ^{[1
]}

机构：

[1] Hiroshima Univ, Grad Sch Engn, Higashihiroshima 7398527, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2008年 / E91A卷 / 04期

关键词：

parallel branch-and-bound algorithms; combinatorial optimization problems; MPI; optimum solutions;

D O I：

10.1093/ietfec/e91-a.4.1140

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A branch-and-bound algorithm (BB for short) is the most general technique to deal with various combinatorial optimization problems. Even if it is used, computation time is likely to increase exponentially. So we consider its parallelization to reduce it. It has been reported that the computation time of a parallel BB heavily depends upon node-variable selection strategies. And, in case of a parallel BB, it is also necessary to prevent increase in communication time. So, it is important to pay attention to how many and what kind of nodes are to be transferred (called sending-node selection strategy). In this paper, for the graph coloring problem, we propose some sending-node selection strategies for a parallel BB algorithm by adopting MPI for parallelization and experimentally evaluate how these strategies affect computation time of a parallel BB on a PC cluster network.

引用

页码：1140 / 1149

页数：10