2000 Fiscal Year Annual Research Report

並列アルゴリズムに対する設計パラダイムと理論モデルの実現可能性に関する研究

Research Project

Project/Area Number	10205209
Research Institution	Nagoya Institute of Technology
Principal Investigator	和田幸一名古屋工業大学, 工学部, 教授 (90167198)
Co-Investigator(Kenkyū-buntansha)	伊藤暢浩名古屋工業大学, 工学部, 助手 (40314075) 中野浩嗣北陸先端大学院大学, 情報科学研究科, 助教授 (30281075) 陳慰名古屋工業大学, 工学部, 助教授 (80262955)
Keywords	PRAM / 再構成メッシュ / 無線ネットワーク / 耐故障性ルーティング / 光通信網 / 並列アルゴリズム
Research Abstract	1.並列計算機理論モデルの検討と実現可能性 PRAMの実現可能性を明らかにする目的で、PRAMの共有メモリへのアクセス方法に対するアルゴリズムの開発とその性能評価を行ない,PRAMのプロセッサ部を効率良く実現するためのCPUアーキテクチャを設計した(研究発表(2),(3)).また,再構成メッシュに対するアルゴリズム設計用ツールを作成した(研究発表(16)). 2.並列・分散アルゴリズムパラダイムの検討 2.1 並列アルゴリズム (1)並列化困難な問題を解く実用的なアルゴリズムの開発と(2)超並列計算の新しいモデル--DNA計算モデル上の問題解決に重点を置いた.研究成果として,(1)については有名な並列化困難な問題:convex layer問題とenvelope問題を解く多項式加速な並列アルゴリズムを提案した(研究発表(12)).(2)については,グラフ問題の新しい符号化方法を提案し,グラフ問題を解くときのDNA量の減少,エラー率の引き下げ,またアルゴリズムの時間計算量の削減することに成功した(研究発表(17)).以上の研究のほか,分散環境に適した行列積計算に対する効率良い並列アルゴリズムの提案(研究発表(18)),平面点集合について耐誤差構造を持つ凸包を求める並列アルゴリズムの開発(研究発表(1),(14),(15)),分割統治法を一般化した並列アルゴリズム設計手法の提案(研究発表(13))などを行なった. 2.2 分散協調アルゴリズム無線ネットワークに対するアルゴリズム,耐故障性ネットワークルーティング,マルチエージェントに対する協調アルゴリズムに対して以下の成果を得た.無線ネットワークに対する、さまざまな基本プロトコルを得た(研究発表(5),(7),(8),(9),(10),(11)).また、耐故障性ネットワークルーティングのサーベイを行なった(研究発表(6)).また,$k$-連結グラフに対する光ネットワークに適した耐故障性の高いルーティングを開発した(研究発表(4)).

Research Products
(18 results)

All Other

All Publications (18 results)

[Publications] Castanho,C.D. et al.: "(1) A Parallel Algorithm for Constructing Strongly Convex Superhulls of Points"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. E83-A,4. 722-731 (2000)
[Publications] Imai,M. et al.: "(2) A Hardware Implementation of PRAM and Its Performance Evaluation"Lecture Notes in Computer Science. 1335. 143-148 (2000)
[Publications] Cui,J. et al.: "(3) Multithreaded Parallel Computer Model with Performance Evaluation"Lecture Notes in Computer Science. 1800. 155-160 (2000)
[Publications] Wada,K.,Chen,W.: "(4) Optimal Fault-Tolerant Routings for $k$-connected Graphs with Smaller Routing Tables"Lecture Notes in Computer Science. 1928. 302-313 (2000)
[Publications] Nakano,K,Olariu,S.: "(5) Randomized Leader Election Protocols for Ad-hoc Networks"Proc.of 7th International Colloquium on Structural Information & Communication Complexity. 253-267 (2000)
[Publications] Wada,K.: "(6) Optimal Fault-Tolerant Routings on Surviving Route Graph Model"Proc.Of International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet. 1-10 (2000)
[Publications] Nakano,K,Olariu,S.: "(7) Randomized Initialization Protocols for Ad-Hoc Networks"IEEE Trans.on Parallel and Distributed Systems. 11,7. 749-759 (2000)
[Publications] Nakano,K,Olariu,S.: "(8) Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with no Collision Detection"IEEE Trans.on Parallel and Distributed Systems. 11,8. 851-863 (2000)
[Publications] Bordim,J. et al.: "(9) Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks"IEICE Trans.Fundamentals. E83-A,9. 1796-1803 (2000)
[Publications] Nakano,K,Olariu S.: "(10) Randomized Leader Election Protocols in Radio Networks with no Collision Detection"Proc.Of International Symposium on Algorithms and Computation (ISAAC00). 362-373 (2000)
[Publications] Nakano,K.,Olariu,S.,Zomaya,A.Y.: "(11) Energy-Efficient Deterministic Routing Protocols in Radio Networks"IEEE Trans.on Parallel and Distributed Systems. (to appear). (2001)
[Publications] Castanho,C.D. et al.: "(12) Polynomially fast parallel algorithms for some P-complete problems"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. (To appear). (2001)
[Publications] Chen,W.,Wada,K.: "(13) Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. (To appear). (2001)
[Publications] Chen,W. et al.: "(14) Constructing A Strongly Convex Superhull of Points"International Journal of Computational Geometry and Applications. (To appear). (2001)
[Publications] Chen,W.,Wada,K.,Kawaguchi K.: "(15) Parallel Robust Algorithms for Constructing Strongly Convex Hulls"Theoretical Computer Science. (To appear). (2001)
[Publications] {Bordim,J.L.,Hayashi,T.,Nakano,K.: "(16) A Tool for Algorithm Visualization on the Reconfigurable Mesh"VLSI design. (To appear).
[Publications] 中本聡,尾関博昭,陳慰,和田幸一: "(17)DNA計算におけるグラフ問題の符号化について"電子情報通信学会技術研究報告. 100,144. 49-56 (2000)
[Publications] 服部真充,伊藤暢浩,陳慰,和田幸一: "(18)分散環境に適した行列積アルゴリズムについて"電子情報通信学会技術研究報告. 100,144. 65-72 (2000)

2000 Fiscal Year Annual Research Report

並列アルゴリズムに対する設計パラダイムと理論モデルの実現可能性に関する研究

Principal Investigator

和田 幸一 名古屋工業大学, 工学部, 教授 (90167198)

Research Products

[Publications] Castanho,C.D. et al.: "(1) A Parallel Algorithm for Constructing Strongly Convex Superhulls of Points"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. E83-A,4. 722-731 (2000)

[Publications] Imai,M. et al.: "(2) A Hardware Implementation of PRAM and Its Performance Evaluation"Lecture Notes in Computer Science. 1335. 143-148 (2000)

[Publications] Cui,J. et al.: "(3) Multithreaded Parallel Computer Model with Performance Evaluation"Lecture Notes in Computer Science. 1800. 155-160 (2000)

[Publications] Wada,K.,Chen,W.: "(4) Optimal Fault-Tolerant Routings for $k$-connected Graphs with Smaller Routing Tables"Lecture Notes in Computer Science. 1928. 302-313 (2000)

[Publications] Nakano,K,Olariu,S.: "(5) Randomized Leader Election Protocols for Ad-hoc Networks"Proc.of 7th International Colloquium on Structural Information & Communication Complexity. 253-267 (2000)

[Publications] Wada,K.: "(6) Optimal Fault-Tolerant Routings on Surviving Route Graph Model"Proc.Of International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet. 1-10 (2000)

[Publications] Nakano,K,Olariu,S.: "(7) Randomized Initialization Protocols for Ad-Hoc Networks"IEEE Trans.on Parallel and Distributed Systems. 11,7. 749-759 (2000)

[Publications] Nakano,K,Olariu,S.: "(8) Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with no Collision Detection"IEEE Trans.on Parallel and Distributed Systems. 11,8. 851-863 (2000)

[Publications] Bordim,J. et al.: "(9) Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks"IEICE Trans.Fundamentals. E83-A,9. 1796-1803 (2000)

[Publications] Nakano,K,Olariu S.: "(10) Randomized Leader Election Protocols in Radio Networks with no Collision Detection"Proc.Of International Symposium on Algorithms and Computation (ISAAC00). 362-373 (2000)

[Publications] Nakano,K.,Olariu,S.,Zomaya,A.Y.: "(11) Energy-Efficient Deterministic Routing Protocols in Radio Networks"IEEE Trans.on Parallel and Distributed Systems. (to appear). (2001)

[Publications] Castanho,C.D. et al.: "(12) Polynomially fast parallel algorithms for some P-complete problems"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. (To appear). (2001)

[Publications] Chen,W.,Wada,K.: "(13) Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. (To appear). (2001)

[Publications] Chen,W. et al.: "(14) Constructing A Strongly Convex Superhull of Points"International Journal of Computational Geometry and Applications. (To appear). (2001)

[Publications] Chen,W.,Wada,K.,Kawaguchi K.: "(15) Parallel Robust Algorithms for Constructing Strongly Convex Hulls"Theoretical Computer Science. (To appear). (2001)

[Publications] {Bordim,J.L.,Hayashi,T.,Nakano,K.: "(16) A Tool for Algorithm Visualization on the Reconfigurable Mesh"VLSI design. (To appear).

[Publications] 中本聡,尾関博昭,陳慰,和田幸一: "(17)DNA計算におけるグラフ問題の符号化について"電子情報通信学会技術研究報告. 100,144. 49-56 (2000)

[Publications] 服部真充,伊藤暢浩,陳慰,和田幸一: "(18)分散環境に適した行列積アルゴリズムについて"電子情報通信学会技術研究報告. 100,144. 65-72 (2000)

和田幸一名古屋工業大学, 工学部, 教授 (90167198)