Paper Abstract and Keywords |
Presentation |
2006-03-07 11:20
Enhancing Performance of PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem Kentaro Nomura, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
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.
We can expect that obtaining a better incumbent
makes bounding operations appear at early stages
of computation, possibly resulting in short computation time.
In case of a parallel BB, it is also necessary to balance
each processor load and to prevent increase in communication time.
In this paper, we focus on a parallel BB for the graph coloring problem,
propose some improvements for it,
and experimentally
evaluate how our modification affect computation time of a parallel BB
on a PC cluster network. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Graph coloring problem / Parallel branch-and-bound algorithms / Combinatorial optimization problems / MPI / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 105, no. 634, CAS2005-121, pp. 19-24, March 2006. |
Paper # |
CAS2005-121 |
Date of Issue |
2006-02-28 (CAS, SIP, CS) |
ISSN |
Print edition: ISSN 0913-5685 |
Download PDF |
|
Conference Information |
Committee |
CAS SIP CS |
Conference Date |
2006-03-06 - 2006-03-07 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Univ of Ryukyu |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
Network processors, signal processing for communications, coding theory, etc. |
Paper Information |
Registration To |
CAS |
Conference Code |
2006-03-CAS-SIP-CS |
Language |
English (Japanese title is available) |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Enhancing Performance of PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem |
Sub Title (in English) |
|
Keyword(1) |
Graph coloring problem |
Keyword(2) |
Parallel branch-and-bound algorithms |
Keyword(3) |
Combinatorial optimization problems |
Keyword(4) |
MPI |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Kentaro Nomura |
1st Author's Affiliation |
Graduate School of Engineering, Hiroshima University (Hiroshima Univ.) |
2nd Author's Name |
Satoshi Taoka |
2nd Author's Affiliation |
Graduate School of Engineering, Hiroshima University (Hiroshima Univ.) |
3rd Author's Name |
Toshimasa Watanabe |
3rd Author's Affiliation |
Graduate School of Engineering, Hiroshima University (Hiroshima Univ.) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2006-03-07 11:20:00 |
Presentation Time |
25 minutes |
Registration for |
CAS |
Paper # |
CAS2005-121, SIP2005-167, CS2005-114 |
Volume (vol) |
vol.105 |
Number (no) |
no.634(CAS), no.636(SIP), no.638(CS) |
Page |
pp.19-24 |
#Pages |
6 |
Date of Issue |
2006-02-28 (CAS, SIP, CS) |
|