ケイリーグラフにおける耐クラスタ故障経路選択アルゴリズムの開発

• 研究課題/領域番号: 22500041
• 研究種目: 基盤研究(C)
• 配分区分: 補助金
• 応募区分: 一般
• 研究分野: 計算機システム・ネットワーク
• 研究機関: 東京農工大学
• 研究代表者: 金子 敬一 東京農工大学, 大学院・工学研究院, 教授 (20194904)
• 研究期間 (年度): 2010 – 2012
• 研究課題ステータス: 完了 (2012年度)
• 配分額: 2,860千円 (直接経費: 2,200千円、間接経費: 660千円); 2012年度: 650千円 (直接経費: 500千円、間接経費: 150千円); 2011年度: 910千円 (直接経費: 700千円、間接経費: 210千円); 2010年度: 1,300千円 (直接経費: 1,000千円、間接経費: 300千円)
• キーワード: ディペンダブルコンピューティング / ディペンダブル・コンピューティング / 相互結合網 / アルゴリズム / 計算機システム / ネットワーク

研究概要

焦げたパンケーキグラフにおいて,2ノード間の耐故障経路選択アルゴリズムを開発し,これを拡張することで2ノード間の耐クラスタ故障経路選択アルゴリズムを開発した.この成果を種々のケイリーグラフに適応する準備として,完全階層型ハイパキューブ相互結合網および階層型キューブ網において,1対多の互いに素な経路選択アルゴリズムを開発した.また,部分列反転グラフにおいて,2ノード間に,内素な経路選択するアルゴリズムを開発した.さらに,完全階層型ハイパキューブ相互結合網において,多対多の互いに素な経路選択アルゴリズムを開発した.

研究成果

• [雑誌論文] Node-to-set Disjoint-path Routing in Hierarchical Cubic Networks (2012)
  • 著者名/発表者名: Bossard, Antoine, and Keiichi Kaneko
  • 雑誌名: The Computer Journal 巻: Vol.55, No.12 号: 12 ページ: 1440-1446
  • DOI: 10.1093/comjnl/bxr137
  • 査読あり
• [雑誌論文] TheSet-to-set Disjoint-path Problem in Perfect Hierarchical Hypercubes (2012)
  • 著者名/発表者名: Bossard, Antoine, and Keiichi Kaneko
  • 雑誌名: The Computer Journal 巻: Vol.55, No.6 号: 6 ページ: 769-775
  • DOI: 10.1093/comjnl/bxr135
  • 査読あり
• [雑誌論文] 部分列反転グラフにおける内素な経路 (2012)
  • 著者名/発表者名: 金子敬一
  • 雑誌名: 電子情報通信学会論文誌 巻: Vol.J95-D,No.1 ページ: 47-53
  • NAID: 110008897585
  • 査読あり
• [雑誌論文] A New Node-to-set Disjoint-path Algorithm in Perfect Hierarchical Hypercubes (2011)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, and Shie-tung Peng
  • 雑誌名: The Computer Journal 巻: Vol.54, No.8 号: 8 ページ: 1372-1381
  • DOI: 10.1093/comjnl/bxr047
  • 査読あり
• [雑誌論文] Fault-tolerant Routing in Burnt Pancake Graphs (2010)
  • 著者名/発表者名: Iwasaki, Tatsuya, and Keiichi Kaneko
  • 雑誌名: Information Processing Letters 巻: Vol.110, No.14-15 号: 14-15 ページ: 535-538
  • DOI: 10.1016/j.ipl.2010.04.023
  • 査読あり
• [雑誌論文] Fault-tolerant Routing in Burnt Pancake Graphs (2010)
  • 著者名/発表者名: T.Iwasaki, K.Kaneko
  • 雑誌名: Information Processing Letters 巻: 110 ページ: 535-538
  • 査読あり
• [学会発表] Fault-tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph (2012)
  • 著者名/発表者名: Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko
  • 学会等名: Proceedings of the International Conference on Advanced Computer Science, Applications and Technologies
  • 発表場所: Kuala Lumpur, Malaysia
• [学会発表] Fault-tolerant Routing Based on Safety Levels in a Hyper-star Graph (2012)
  • 著者名/発表者名: Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko
  • 学会等名: Proceedings of the IADIS International Conference on Applied Computing 2012
  • 発表場所: Madrid, Spain
• [学会発表] A Fault-tolerant Routing Algorithm using Directed Probabilities in Hypercube Net-works (2012)
  • 著者名/発表者名: Myojin, Manabu, and Keiichi Kaneko
  • 学会等名: Proceedings of the 2012 International Conference on Parallel and Distributed Processing Techniques and Applications
  • 発表場所: Las Vegas, Nevada, USA
• [学会発表] A Fault-tolerant Routing Algorithm using Directed Probabilities in Hypercube Networks (2012)
  • 著者名/発表者名: Manabu Myojin
  • 学会等名: The 2012 International Conference on Parallel and Distributed Processing Techniques and Applications
  • 発表場所: Las Vegas, Nevada, USA
• [学会発表] Fault-tolerant Routing Based on Safety Levels in a Hyper-star Graph (2012)
  • 著者名/発表者名: Yo Nishiyama
  • 学会等名: The IADIS International Conference on Applied Computing 2012
  • 発表場所: Madrid, Spain
• [学会発表] Fault-tolerant Routing Based on Directed Safety Levels in a Hyper-star Graph (2012)
  • 著者名/発表者名: Yo Nishiyama
  • 学会等名: The International Conference on Advanced Computer Science, Applications and Technologies
  • 発表場所: Kuala Lumpur, Malaysia
• [学会発表] Fault-tolerant Routing Algorithms based on Approximate Directed Routable Probabilities for Hypercubes (2011)
  • 著者名/発表者名: Dinh Thuy Duong, Keiichi Kaneko
  • 学会等名: 11th International Conference on Algorithms and Architectures for Parallel Processing
  • 発表場所: Melbourne, Australia
  • 年月日: 2011-10-24
• [学会発表] A Routing Algorithm of Pairwise Disjoint Paths in a Burnt Pancake Graph (2011)
  • 著者名/発表者名: Iwasaki, Tatsuya, Keiichi Kaneko
  • 学会等名: nd International Symposium on Information and Communication Technology
  • 発表場所: Hanoi, Vietnam
  • 年月日: 2011-10-13
• [学会発表] Fault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks (2011)
  • 著者名/発表者名: Dinh Thuy Duong, Keiichi Kaneko
  • 学会等名: 2011 International Conference on Parallel and Distributed Processing Techniques and Applications
  • 発表場所: Las Vegas, USA
  • 年月日: 2011-07-18
• [学会発表] Node-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes (2011)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, Shietung Peng
  • 学会等名: International Conference on Computational Science
  • 発表場所: Singapore
  • 年月日: 2011-06-01
• [学会発表] Set-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes (2011)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, Shietung Peng
  • 学会等名: Fourth International C* Conference on Computer Science & Software Engineering
  • 発表場所: Montreal, Canada
  • 年月日: 2011-05-16
• [学会発表] An Algorithm for Node-to-Set Disjoint Paths Problem in a Substring Reversal Graph (2011)
  • 著者名/発表者名: Jung, Sinyu, Keiichi Kaneko
  • 学会等名: 8th Joint Conference on Computer Science and Software Engineering
  • 発表場所: Nakhon Pathom, Thailand
  • 年月日: 2011-05-11
• [学会発表] Fault-tolerant Routing Algorithms based on Approximate Directed Routable Probabilities for Hypercubes (2011)
  • 著者名/発表者名: Dinh Thuy Duong and Keiichi Kaneko
  • 学会等名: Proceedings of the 11th International Conference on Algorithms and Architectures for Parallel Processing
  • 発表場所: Melbourne, Australia
• [学会発表] ARouting Algorithm of Pairwise Disjoint Paths in a Burnt Pancake Graph (2011)
  • 著者名/発表者名: Iwasaki, Tatsuya, and Keiichi Kaneko
  • 学会等名: Proceedings of the2nd International Symposium on Information and Communication Technology
  • 発表場所: Hanoi, Vietnam
• [学会発表] Fault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks (2011)
  • 著者名/発表者名: Dinh Thuy Duong and Keiichi Kaneko
  • 学会等名: Proceedings of the 2011 International Conference on Parallel and Distributed Processing Techniques and Applications
  • 発表場所: Las Vegas, Nevada, USA
• [学会発表] Node-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes (2011)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • 学会等名: Proceedings of the International Conference on Computational Science
  • 発表場所: Singapore
• [学会発表] Set-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes (2011)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • 学会等名: Proceedings of the Fourth International C* Conference on Computer Science & Software Engineering
  • 発表場所: Montreal, Quebec, Canada
• [学会発表] An Algorithm for Node-to-set Disjoint Paths Problem in a Substring Reversal Graph (2011)
  • 著者名/発表者名: Jung, Sinyu, and Keiichi Kaneko
  • 学会等名: Proceedings of the 8th Joint Conference on Computer Science and Software Engineering
  • 発表場所: Nakhon Pathom, Thailand
• [学会発表] Set-to-set Disjoint Path Routing Algorithm in Burnt Pancake Graphs (2011)
  • 著者名/発表者名: Iwasawa, Nagateru, Antoine Bossard, and Keiichi Kaneko
  • 学会等名: Proceedings of the ISCA 26th International Conference on Computers and their Applications
  • 発表場所: New Orleans, Louisiana, USA
• [学会発表] A Node-to-Set Disjoint-path Routing Algorithm in Perfect Hierarchical Hypercubes (2010)
  • 著者名/発表者名: A.Bossard, K.Kaneko, S.Peng
  • 学会等名: 1st Int'l Conf.Advanced Computing and Communications
  • 発表場所: Orlando, USA
  • 年月日: 2010-09-15
• [学会発表] A Feedback Vertex Set on Pancake Graphs (2010)
  • 著者名/発表者名: S.Jung, K.Kaneko
  • 学会等名: 2010 Int'l Conf.Parallel and Distributed Processing Techniques and Applications
  • 発表場所: Las Vegas, USA
  • 年月日: 2010-07-12
• [学会発表] Fault-tolerant Node-to-set Disjoint-path Routing in Hypercubes (2010)
  • 著者名/発表者名: A.Bossard, K.Kaneko, S.Peng
  • 学会等名: 10th Int'l Conf.Algorithms and Architectures for Parallel Processing
  • 発表場所: Busan, Korea
  • 年月日: 2010-05-21
• [学会発表] Cluster-fault-tolerant Routing in Burnt Pancake Graphs (2010)
  • 著者名/発表者名: N.Iwasawa, T.Watanabe, T.Iwasaki, K.Kaneko
  • 学会等名: 2010 Int'l Symp.Frontiers of Parallel and Distributed Computing
  • 発表場所: Busan, Korea
  • 年月日: 2010-05-21
• [学会発表] Set-to-set Disjoint-path Routing in Metacube (2010)
  • 著者名/発表者名: Peng, Shietung, and Keiichi Kaneko
  • 学会等名: Proceedings of the Eleventh International Conference on Parallel and Distributed Computing, Applications and Technologies
  • 発表場所: Wuhan, China
• [学会発表] Node-to-set Disjoint Paths Routing in Metacube (2010)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, andShietung Peng
  • 学会等名: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
  • 発表場所: Marina del Rey, California, USA
• [学会発表] A Node-to-set Disjoint-path Routing Algorithm in Perfect Hierarchical Hypercubes (2010)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • 学会等名: Proceedings of the First International Conference on Advanced Computing and Communications
  • 発表場所: Orlando, Florida, USA
• [学会発表] A FeedbackVertex Set on Pancake Graphs (2010)
  • 著者名/発表者名: Jung, Sinyu, and Keiichi Kaneko
  • 学会等名: Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications
  • 発表場所: Las Vegas, Nevada, USA
• [学会発表] Cluster-fault-tolerant Routing in Burnt Pancake Graphs (2010)
  • 著者名/発表者名: Iwasawa, Nagateru, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko
  • 学会等名: Proceedings of the 2010 International Symposium on Frontiers of Parallel and Distributed Computing
  • 発表場所: Busan, Korea
• [学会発表] Fault-tolerant Node-to-set Disjoint-path Routing in Hypercubes (2010)
  • 著者名/発表者名: Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
  • 学会等名: Proceedings of the 10th International Conference on Algorithms and Architectures for Parallel Processing
  • 発表場所: Busan, Korea