Decentralized social algorithm for committee coordination problem

Tongjun Huang, Zixue Cheng, Minetada Osano, Norio Shiratori

    研究成果: Conference contribution

    1 被引用数 (Scopus)

    抄録

    In this paper, we consider an extended committee coordination problem in an autonomous decentralized social environment. The basic committee coordination problem and a distributed algorithm, as a solution to this problem in distributed environment, are presented by K.M. Chandy and J. Misra in [1]. The algorithm guarantees the synchronous and exclusion properties of the problem and is fair (i.e. starvation-free) and makes progress (i.e. deadlock-free). In an autonomous decentralized social environment, besides the above mentioned properties, some social properties, such as individual preference[2], privacy protection[2], and stable assignment[3], are required to be considered and guaranteed. In this paper, we extend the committee coordination problem by introducing some social properties, such as individual preference and stable assignment and give a decentralized social algorithm as a solution to this extended problem. The algorithm guarantees not only the synchronous and exclusion properties but also individual preference and stable assignment properties.

    本文言語English
    ホスト出版物のタイトルProceedings of the International Symposium on Autonomous Decentralized Systems
    編集者 Anon
    Place of PublicationPiscataway, NJ, United States
    出版社IEEE
    ページ345-351
    ページ数7
    出版ステータスPublished - 1995
    イベントProceedings of the 2nd International Symposium on Autonomous Decentralized Systems - Phoenix, AZ, USA
    継続期間: 1995 4 251995 4 27

    Other

    OtherProceedings of the 2nd International Symposium on Autonomous Decentralized Systems
    CityPhoenix, AZ, USA
    Period95/4/2595/4/27

    ASJC Scopus subject areas

    • ハードウェアとアーキテクチャ
    • 工学(その他)

    フィンガープリント

    「Decentralized social algorithm for committee coordination problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル