• 研究課題をさがす
  • 研究者をさがす
  • KAKENの使い方
  1. 課題ページに戻る

2016 年度 実施状況報告書

大規模並列アルゴリズムポートフォリオの構築と実行の研究

研究課題

研究課題/領域番号 25330253
研究機関東京大学

研究代表者

福永 ALEX  東京大学, 大学院総合文化研究科, 准教授 (90452002)

研究期間 (年度) 2013-04-01 – 2018-03-31
キーワード人工知能
研究実績の概要

A significant technical issue when executing parallel portfolio algorithms is the reduction of communications overhead among processors involved in the parallel computation.
One well-known approach to work distribution among processors is hash-based work distribution, in which work units are assigned to processors according to a hash value (signature) computed based on features of the work unit. In earlier work, we investigated Zobrist hashing, which achieve good load balancing at the cost of high communications overhead.
This year, we developed Abstract Zobrist Hashing, a new method for distributing work among processors which significantly reduces communications overhead compared to Zobrist hashing. This method computes hash signatures based on "abstract features", i.e., projectsions of a state rather than the state itself. We evaluated Abstract Zobrist Hashing on several classes of benchmark problem domains: sliding tiles puzzles (16-puzzle and 24-puzle), multiple sequence alignment, and a set of domain-independent planning instances from the International Planning Competition. We showed that compared to previous work distribution methods, Abstract Zobrist Hashing achieved significantly better parallel efficiency.

現在までの達成度 (区分)
現在までの達成度 (区分)

2: おおむね順調に進展している

理由

In this project, we have investigated the following algorithmic issues related to parallel algorithm portfolios:
We investigated randomized portfolios models for evolutionary evolution, specifically a Randomized Heterogeneous Model which randomly assigns random control parameters for distributed evolutionary algorithms on each processor.
We also investigated a portfolio based approach for domain-independent classical problem which uses multiple integer/linear programming models, each with a different set of constraints is generated for a given planning problem instance.
We have also investigated methods for efficiently distributed workloads among parallel processors which reduce communications overhead.

今後の研究の推進方策

We will continue investigating parallel workload distribution mechanisms. This will extend the work on Abstract Zobrist Hashing which was perfomed this year. Note that this research project was originally scheduled to be completed in fiscal year H28, and was extended into fiscal year H29 because a conference trip to present results of this project which was planned to be funded by this project was cancelled due to illness. Thus, next year, work on this project will be combined and integrated with its successor project on heterogeneous parallel search algorithms.

次年度使用額が生じた理由

Originally, funds from this research project were planned to be used in order to attend a conference held in February, 2017. This trip was cancelled due to illness, and therefore, discussions regarding this project which were planned during that conference needed to be postponed until the next fiscal year (H29). Therefore, an extension was requested.

次年度使用額の使用計画

The plan is to use the funds to travel to a conference during fiscal year H29 in order to present results related to this research project as well as engage in discussion of this research project with international researchers.

  • 研究成果

    (2件)

すべて 2016

すべて 雑誌論文 (2件) (うち国際共著 1件、 査読あり 2件、 オープンアクセス 2件)

  • [雑誌論文] Abstract Zobrist Hashing: An Efficient Work Distribution Method for Parallel Best-First Search2016

    • 著者名/発表者名
      Jinnai Yuu, Alex Fukunaga
    • 雑誌名

      Proceedings of 30th AAAI Conference on Artificial Intelligence (AAAI-2016)

      巻: 1 ページ: 717-723

    • 査読あり / オープンアクセス / 国際共著
  • [雑誌論文] Automated Creation of Work Distribution Functions for Parallel Best-First Search2016

    • 著者名/発表者名
      Jinnai Yuu, Alex Fukunaga
    • 雑誌名

      Proceedings of International Conference on Automated Planning and Scheduling

      巻: 1 ページ: 184-192

    • 査読あり / オープンアクセス

URL: 

公開日: 2018-01-16  

サービス概要 検索マニュアル よくある質問 お知らせ 利用規程 科研費による研究の帰属

Powered by NII kakenhi