• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2004 Fiscal Year Final Research Report Summary

A Study on Efficient Problem Solving for Combinatorial Problems Using Programmable Logic Devices

Research Project

Project/Area Number 15500040
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Computer system/Network
Research InstitutionHiroshima City University

Principal Investigator

WAKABAYASHI Shinichi  Hiroshima City University, Faculty of Information Sciences, Professor, 情報科学部, 教授 (50210860)

Project Period (FY) 2003 – 2004
KeywordsFPGA / combinatorial problem / NP-hard / branch and bound / instance-specific / hardware solver
Research Abstract

Reconfigurable computing with Field Programmable Gate Arrays (FPGAs) has become popular as a new approach to combinatorial problems. In particular, problem solving by instance-specific accelerators has been widely noticed such as the Boolean satisfiability problem, the minimum cover problem, etc. In this study, we present a novel approach to solving several NP-hard problems on graphs such as the maximum clique problem, the minimum vertex cover problem, and the minimum dominating set problem, based on reconfigurable computing. In the proposed approach, for a given instance of each problem, an HDL description of an instance-specific accelerator is generated to produce an optimum solution of the problem. The generated instance-specific accelerator is based on branch & bound search with various pruning techniques. Furthermore, pipeline and parallel processing are introduced to speed up the computation time. We also developed a system, which generates the Verilog HDL description of the accelerator automatically for a given problem instance. The generated Verilog description is compiled and downloaded to an FPGA as configuration data to solve the problem by hardware. Experimental results showed that, compared with the software solver, the proposed algorithm produced an optimum solution of the problem in a 'very shorter running time even if the time for circuit synthesis and configuration of FPGA was taken into account.

  • Research Products

    (12 results)

All 2005 2004 Other

All Journal Article (12 results)

  • [Journal Article] グラフ最小節点被覆問題に対するFPGAを用いたインスタンス依存ハードウェア解法2005

    • Author(s)
      菊池健司
    • Journal Title

      電子情報通信学会技術研究報告 VLD2004-106

      Pages: 51-56

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] 最小支配集合問題を解くインスタンス依存ハードウェア解法2005

    • Author(s)
      有路忠臣
    • Journal Title

      第4回情報科学技術フォーラム講演論文集 (発表予定)

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] An instance-specific hardware algorithm using FPGAs for the minimum vertex cover problem of a graph2005

    • Author(s)
      Kenji Kikuchi
    • Journal Title

      IEICE Technical Report VLD2004-106

      Pages: 51-56

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] An instance-specific hardware algorithm for finding a maximum clique2004

    • Author(s)
      Shinichi Wakabayashi
    • Journal Title

      Proc.International Conference on Field Programmable Logic and Applications (FPL 2004) LNCS 3203

      Pages: 516-525

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] 最大クリークを求めるデータ依存ハードウェアアルゴリズムの実装と評価2004

    • Author(s)
      若林真一
    • Journal Title

      電子情報通信学会技術研究報告 VLD2003-135

      Pages: 61-66

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] FPGAを用いた最大クリーク問題の高速解法2004

    • Author(s)
      菊池健司
    • Journal Title

      平成16年度電気・情報関連学会中国支部第55回連合大会講演論文集 122005

      Pages: 309-310

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] 最大クリーク問題を解くインスタンス依存ハードウェア解法2004

    • Author(s)
      菊池健司
    • Journal Title

      第6回IEEE広島支部学生シンポジウム論文集

      Pages: 235-238

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] An instance-specific hardware algorithm for finding a maximum clique2004

    • Author(s)
      Shinichi Wakabayashi
    • Journal Title

      Proc.International Conf.on Field Programmable Logic and Applications LNCS 3203

      Pages: 516-525

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Implementation and evaluation of an instance-specific hardware algorithm for finding a maximum clique2004

    • Author(s)
      Shinichi Wakabayashi
    • Journal Title

      IEICE Technical Report VLD2003-135

      Pages: 61-66

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] An efficient method for the maximum clique problem using FPGAs2004

    • Author(s)
      Kenji Kikuchi
    • Journal Title

      Proc.Joint-Chugoku Chapter Conference 122005

      Pages: 309-310

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] An instance-specific hardware algorithm for solving the maximum clique problem2004

    • Author(s)
      Kenji Kikuchi
    • Journal Title

      Proc.IEEE Hiroshima Section Student Symposium

      Pages: 235-238

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] An instance-specific hardware algorithm for solving the minimum dominating set problem

    • Author(s)
      Tadaomi Ariji
    • Journal Title

      Proc.Forum on Information Technology (to appear)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2006-07-11  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi