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

1990 Fiscal Year Final Research Report Summary

Study of Co-operative Problem Solving Methods in Distributed Network Environment

Research Project

Project/Area Number 01580030
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field Informatics
Research InstitutionOsaka University

Principal Investigator

HAGIHARA Kenichi  Osaka University, Faculty of Engineering Science, Associate Professor, 基礎工学部, 助教授 (00133140)

Project Period (FY) 1989 – 1990
KeywordsDistributed Algorithm / Message Complexity / Minimum Weight Spanning Tree / Louder Election Problem / Fail-Stop / Global Sense of Direction / Complete Network
Research Abstract

(1) It is considered the Updating Minimum Spanning Tree Problem (UMP), that is, the problem to update the Minimum-weight Spanning Tree (MST) in response to topology change of network. The distributed algorithm is proposed which reconstructs the MST after several links are deleted and added. Its message complexity and its ideal-time complexity are 0 (m+n・log (t+f)) and 0 (n+n・log (t+f)) respectively, where n is the number of processors in the network, t (resp. f) is the number of added links (resp. the number of deleted links of the old MST), and m=t+n if f=0, m=e (i. e. the number of links in the network after topology change) otherwise. And the distributed algorithms is also proposed which deals with deletion and addition of processors as well as links.
(2) The leader election problem (LEP) in asynchronous complete networks with undetectable fail-stop failures is considered. Especially, it is discussed whether presence of a global sense of direction affects the message complexity of LEP in faulty networks. For a complete network of n processors where k processors start the algorithm spontaneously and at most f (<n/2) processors are faulty, the message complexity of LEP is rheta (n+k.f) if the complete network has a global sense of direction. It is already known that LEP requires OMEGA (n. log k + k・f) message exchanges, if the complete netwo
rk has no global sense of direction. Therefore, this result implies that the message complexity of LEP can be greatly reduced by using a global sense of direction in faulty networks as well as in reliable networks.

  • Research Products

    (10 results)

All Other

All Publications (10 results)

  • [Publications] 萩原 兼一: "分散アルゴリズム" 人工知能学会誌. 5. 430-440 (1990)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 萩原 兼一: "分散アルゴリズム" 情報処理学会誌. 31. 1245-1256 (1990)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Jungho Park: "Distributed Algorithms for Rcconstructing MST after Topology Change" Proc. of 4th International Workshop on Distributed Algorithms. (1990)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 朴 政鎬: "重み最小生成木更新問題を解く分散アルゴリズム" 電子情報通信学会論文誌(D1). J73ーDーI. 802-811 (1990)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 増澤 利光: "方向感覚付き完全ネットワ-クにおけるプロセッサ故障耐性のあるリ-ダ選択アルゴリズム" 電子情報通信学会論文誌(D1). J73ーDーI. 818-828 (1990)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Kenichi HAGIHARA: "Distributed Algorithms" Journal of Japanese Society for Artificail Intelligence. Vol. 5, No. 4. 430-440 (1990)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Kenichi HAGIHARA: "Distributed Algorithms" Information Processing Society Japan. Vol. 31, No. 9. 1245-1256 (1990)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Jungho Park, Toshimitsu Masuzawa, Ken'ichi Hagihara, Nobuki Tokura and Haesool Yang: "Distributed Algorithms for Reconstructing MST after Topology Change" Proc. of 4th International Workshop on Distributed Algorithms, (to appear in Lecture Notes in Computer Science, Springer-Verlag). Bari, Italy. (1990)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Jungho Park, Toshimitsu Masuzawa, Ken'ichi Hagihara, and Nobuki Tokura: "Efficient Distributed Algorithm to Solve Updating Minimum Spanning Tree Problem" The Transaction of the Institute of Electronics, Information and Communication Engineers D-I. Vol. J73-D-I No. 10. 802-811 (1990)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Toshimitsu Masuzawa, Naoki Nishikawa, Ken'ichi Hagihara, and Nobuki Tokura: "A Fault Tolerant Algorithm for Election in Complete Networks with a Sense of Direction" The Transaction of the Institute of Electronics, Information and Communication Engineers D-I. Vol. J73-D-1, No. 10. 818-828 (1990)

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

URL: 

Published: 1993-08-12  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi