2007 Fiscal Year Final Research Report Summary
A Study on Reconfigurable Engine for Efficient Problem Solving for Combinatorial Optimization Problems
| Project/Area Number |
18500042
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Computer system/Network
|
|---|
| Research Institution | Hiroshima City University |
|---|
Principal Investigator |
WAKABAYASHI Shinichi Hiroshima City University, Graduate School of Information Sciences, Professor (50210860)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
NAGAYAMA Shinobu Hiroshima City University, Graduate School of Information Sciences, Assistant Professor (10405491)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Keywords | Quadratic assignment problem / Tabu search / FPGA / Systolic algorithm / Parallel algorithm / Pipeline processing |
|---|
| Research Abstract |
The quadratic assignment problem (QAP), which is one of NP-hard combinatorial optimization problems, is known to be difficult to be solved optimally with ordinary optimization methods. In this research, we investigated parallel algorithms to solve the quadratic assignment problem in a short execution time, and proposed a hardware algorithm to efficiently solve the QAP. The proposed algorithm is based on tabu search, and its main body is a systolic algorithm, which runs on a one-dimensional array of simple processing units. During the algorithm execution, multiple neighborhood solutions are evaluated in parallel and each solution is evaluated in a pipeline fashion. The proposed algorithm effectively utilizes internal block RAMs of recent large scale FPGAs. The proposed hardware QAP solver was designed with Verilog-HDL, and implemented on a FPGA board. Experimental results showed the efficiency and effectiveness of the proposed algorithm. Results obtained by this research have been presented in several domestic and international conferences.
|
