Decentralized social algorithm for committee coordination problem

Tongjun Huang, Zixue Cheng, Minetada Osano, Norio Shiratori

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationProceedings of the International Symposium on Autonomous Decentralized Systems
    Editors Anon
    Place of PublicationPiscataway, NJ, United States
    PublisherIEEE
    Pages345-351
    Number of pages7
    Publication statusPublished - 1995
    EventProceedings of the 2nd International Symposium on Autonomous Decentralized Systems - Phoenix, AZ, USA
    Duration: 1995 Apr 251995 Apr 27

    Other

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

    Fingerprint

    Parallel algorithms

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Engineering (miscellaneous)

    Cite this

    Huang, T., Cheng, Z., Osano, M., & Shiratori, N. (1995). Decentralized social algorithm for committee coordination problem. In Anon (Ed.), Proceedings of the International Symposium on Autonomous Decentralized Systems (pp. 345-351). Piscataway, NJ, United States: IEEE.

    Decentralized social algorithm for committee coordination problem. / Huang, Tongjun; Cheng, Zixue; Osano, Minetada; Shiratori, Norio.

    Proceedings of the International Symposium on Autonomous Decentralized Systems. ed. / Anon. Piscataway, NJ, United States : IEEE, 1995. p. 345-351.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Huang, T, Cheng, Z, Osano, M & Shiratori, N 1995, Decentralized social algorithm for committee coordination problem. in Anon (ed.), Proceedings of the International Symposium on Autonomous Decentralized Systems. IEEE, Piscataway, NJ, United States, pp. 345-351, Proceedings of the 2nd International Symposium on Autonomous Decentralized Systems, Phoenix, AZ, USA, 95/4/25.
    Huang T, Cheng Z, Osano M, Shiratori N. Decentralized social algorithm for committee coordination problem. In Anon, editor, Proceedings of the International Symposium on Autonomous Decentralized Systems. Piscataway, NJ, United States: IEEE. 1995. p. 345-351
    Huang, Tongjun ; Cheng, Zixue ; Osano, Minetada ; Shiratori, Norio. / Decentralized social algorithm for committee coordination problem. Proceedings of the International Symposium on Autonomous Decentralized Systems. editor / Anon. Piscataway, NJ, United States : IEEE, 1995. pp. 345-351
    @inproceedings{7ef20ed703c9470dbb5b92d6cdd1d5fc,
    title = "Decentralized social algorithm for committee coordination problem",
    abstract = "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.",
    author = "Tongjun Huang and Zixue Cheng and Minetada Osano and Norio Shiratori",
    year = "1995",
    language = "English",
    pages = "345--351",
    editor = "Anon",
    booktitle = "Proceedings of the International Symposium on Autonomous Decentralized Systems",
    publisher = "IEEE",

    }

    TY - GEN

    T1 - Decentralized social algorithm for committee coordination problem

    AU - Huang, Tongjun

    AU - Cheng, Zixue

    AU - Osano, Minetada

    AU - Shiratori, Norio

    PY - 1995

    Y1 - 1995

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0029218696&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0029218696&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:0029218696

    SP - 345

    EP - 351

    BT - Proceedings of the International Symposium on Autonomous Decentralized Systems

    A2 - Anon, null

    PB - IEEE

    CY - Piscataway, NJ, United States

    ER -