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

自律分散システムにおける大域情報と局所情報

Research Project

Project/Area Number 12878052
Research Category

Grant-in-Aid for Exploratory Research

Allocation TypeSingle-year Grants
Research Field 計算機科学
Research InstitutionKyushu University

Principal Investigator

山下 雅史  九州大学, システム情報科学研究院, 教授 (00135419)

Project Period (FY) 2000 – 2002
Project Status Completed (Fiscal Year 2002)
Budget Amount *help
¥2,100,000 (Direct Cost: ¥2,100,000)
Fiscal Year 2002: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2001: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2000: ¥800,000 (Direct Cost: ¥800,000)
Keywords分散システム / 分散アルゴリズム / 大域情報 / 局所情報 / ランダムウォーク / ヒッティング時間 / カバー時間 / 競合解消問題
Research Abstract

互いに通信しながら自律的に動作するプロセス集合を分散システムと呼ぶ.プロセスは逐次プログラムの実行をモデル化したものであるが,分散システムの定義を少し拡張し,プロセスを自律的な計算主体と定義することで分散ロボットシステムや社会システムなども分散システムの範囲に入れることができる.
分散アルゴリズム設計の基本的な困難さは局所情報を用いて大域的に矛盾のない判断を下さなければならないところにあり,従って,分散アルゴリズム研究の本質が大域情報と局所情報の関わりを研究する所にある.12年度に開始され今年度に最終年度を向かえた本萌芽研究の目指す所はその解明にあった.過去2年間の成果はそれぞれの年度の実績報告書に報告したが,本年度は,それらに,以下で説明する素晴らしい発見を付け加えることができた.
グラフ上のランダムウォークは分散アルゴリズムばかりでなく様々な領域で用いられている基本概念の一つである.分散アルゴリズムの領域に限っても,インターネットのWEB探索やアドホックネットワークの通信など多彩な応用が報告されている.これらの応用では,その効率はヒッティング時間に依存する.グラフの頂点数をnとすると,通常のランダムウォークのヒッティング時間はO(n^∧3)であるが,隣接ノードの情報を利用することによりヒッティング時間がO(n^∧2)に減少でき,しかも,最悪の場合には,(大域情報も含めて)これ以上の情報はヒッティング時間の減少には寄与しないことを示した.

Report

(3 results)
  • 2002 Annual Research Report
  • 2001 Annual Research Report
  • 2000 Annual Research Report
  • Research Products

    (19 results)

All Other

All Publications (19 results)

  • [Publications] A.Dumitrescu, I.Suzuki, M.Yamashita: "High Speed Formations of Reconfigurable Modular Robotic Systems"Proc. 2002 IEEE International Conference on Robotics and Automation. 123-128 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] H.Kakugawa, M.Yamashita: "Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings with Unfair Distributed Daemon"Journal of Parallel and Distributed Computing. 62. 885-898 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] K.Makino, M.Yamashita, T.Kameda: "Max-and Min-Neighborhood Monopolies"Algorithmica. 34. 240-260 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] S.Ikeda, N.Okumoto, I.Kubo, M.Yamashita: "Fair Circulation of a Token"IEEE Trans. Parallel and Distributed Systems. 13・4. 367-372 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] T.Harada, M.Yamashita: "k-Coteries for Tolerating Network 2-Partition"Proc. 6th International Conference On Principles Of DIstributed Systems (OPODIS'02). 119-126 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] H.Kakugawa, M.Yamashita: "Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct"Proc. 21st IEEE Symposium on Reliable Distributed Systems. 202-211 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] K.Makino, M.Yamashita, T.Kameda: "Max and Min-Neighborhood Monopolies"Algorithmica. (to appear).

    • Related Report
      2001 Annual Research Report
  • [Publications] H.Kakugawa, M.Yamashita: "Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings with Unfair Distributed Daemon"Journal of Parallel and Distributed Computing. (to appear).

    • Related Report
      2001 Annual Research Report
  • [Publications] S.Ikeda, N.Okumoto, I.Kubo, M.Yamashita: "Fair Circulation of a Token"IEEE Trans. Parallel and Distributed System. (to appear).

    • Related Report
      2001 Annual Research Report
  • [Publications] M.Yamashita, H.Umemoto, I.Suzuki, T.Kameda: "Searching for a Mobile Intruder in a Polygonal Regionby a Group of Mobile Searchers"Algorithmica. 31. 208-236 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] T.Harada, M.Yamashita: "A Coterie Join Operation and Tree Structured K-Coteries"IEEE Trans. Parallel and Distibuted Systems. 12・9. 865-874 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] T.Nakata, M.Yamashita: "Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game"Proc. 8th Colloquium on Structural Information and Communication Complexity. 293-304 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] 杉原厚吉, 茨木俊秀, 浅野孝夫, 山下雅史: "アルゴリズム工学"共立出版. (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] T.Nakata,H.Imahayashi,and M.Yamashita: "A Probabilistic Local Majority Polling Game on Weighted Directed Graphs with an Application to the Distributed Agreement Problem"Networks. 35・4. 266-273 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] S.Fujita,M.Yamashita,and T.Kameda: "A Study on r-Configuration-a Resource Assignment Problem on Graphs"SIAM J.Discrete Mathematics. 13・2. 227-254 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 山下雅史: "分散計算における対称性(招待解説論文)"電子情報通信学会論文誌D-I. J83-D-1・1. 26-35 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] K.Makino,M.Yamashita,and T.Kameda: "Max-and Min-Neighborhood Monopolies"Lecture Notes in Computer Science 1851. 513-526 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] S.Fujita and M.Yamashita: "A Fully Decentralized and Oblivious Multi-Node Broadcast Algorithm in Hypercubes"International Conference on Algorithms and Architectures for Parallel Processing. 292-303 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] S.Fujita,T.Nakagawa,and M.Yamashita: "A New List Scheduling Method Based on Structural Properties of Task Graphs"Second Int'l Workshop on Multimedia Network Systems (MMNS'2000) in conjunction with ICPADS 2000. 3-8 (2000)

    • Related Report
      2000 Annual Research Report

URL: 

Published: 2000-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi