A new token based protocol for group mutual exclusion in distributed systems

Quazi Ehsanul Kabir Mamun, Hidenori Nakazato

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

    7 Citations (Scopus)

    Abstract

    In this paper we present a new token based protocol for group mutual exclusion in distributed systems. The protocol uses one single token to allow multiple processes to enter the critical section for a common session. One of the significant characteristics of the protocol is - concurrency, throughput and waiting time can be regulated adjusting the time period for which a session is declared. The minimum and the maximum number of messages to enter the CS is O and (n + 2) respectively where n is the total number of processes in the system. Moreover, simulation results show that the protocol, on average case, considerably reduces the number of messages per entry to the CS and also requires much lower waiting times. The maximum concurrency the protocol supports is n. The protocol also ensures no starvation in the system. Furthermore, this algorithm works out for the Extended Group Mutual Exclusion problem as well.

    Original languageEnglish
    Title of host publicationProceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006
    Pages34-41
    Number of pages8
    DOIs
    Publication statusPublished - 2006
    Event5th International Symposium on Parallel and Distributed Computing, ISPDC 2006 - Timisoara
    Duration: 2006 Jul 62006 Jul 9

    Other

    Other5th International Symposium on Parallel and Distributed Computing, ISPDC 2006
    CityTimisoara
    Period06/7/606/7/9

    Fingerprint

    Throughput

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Software
    • Hardware and Architecture

    Cite this

    Mamun, Q. E. K., & Nakazato, H. (2006). A new token based protocol for group mutual exclusion in distributed systems. In Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006 (pp. 34-41). [4021907] https://doi.org/10.1109/ISPDC.2006.4

    A new token based protocol for group mutual exclusion in distributed systems. / Mamun, Quazi Ehsanul Kabir; Nakazato, Hidenori.

    Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006. 2006. p. 34-41 4021907.

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

    Mamun, QEK & Nakazato, H 2006, A new token based protocol for group mutual exclusion in distributed systems. in Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006., 4021907, pp. 34-41, 5th International Symposium on Parallel and Distributed Computing, ISPDC 2006, Timisoara, 06/7/6. https://doi.org/10.1109/ISPDC.2006.4
    Mamun QEK, Nakazato H. A new token based protocol for group mutual exclusion in distributed systems. In Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006. 2006. p. 34-41. 4021907 https://doi.org/10.1109/ISPDC.2006.4
    Mamun, Quazi Ehsanul Kabir ; Nakazato, Hidenori. / A new token based protocol for group mutual exclusion in distributed systems. Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006. 2006. pp. 34-41
    @inproceedings{82e644da97e14cbd93aa06e5d2dc9cf4,
    title = "A new token based protocol for group mutual exclusion in distributed systems",
    abstract = "In this paper we present a new token based protocol for group mutual exclusion in distributed systems. The protocol uses one single token to allow multiple processes to enter the critical section for a common session. One of the significant characteristics of the protocol is - concurrency, throughput and waiting time can be regulated adjusting the time period for which a session is declared. The minimum and the maximum number of messages to enter the CS is O and (n + 2) respectively where n is the total number of processes in the system. Moreover, simulation results show that the protocol, on average case, considerably reduces the number of messages per entry to the CS and also requires much lower waiting times. The maximum concurrency the protocol supports is n. The protocol also ensures no starvation in the system. Furthermore, this algorithm works out for the Extended Group Mutual Exclusion problem as well.",
    author = "Mamun, {Quazi Ehsanul Kabir} and Hidenori Nakazato",
    year = "2006",
    doi = "10.1109/ISPDC.2006.4",
    language = "English",
    isbn = "0769526381",
    pages = "34--41",
    booktitle = "Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006",

    }

    TY - GEN

    T1 - A new token based protocol for group mutual exclusion in distributed systems

    AU - Mamun, Quazi Ehsanul Kabir

    AU - Nakazato, Hidenori

    PY - 2006

    Y1 - 2006

    N2 - In this paper we present a new token based protocol for group mutual exclusion in distributed systems. The protocol uses one single token to allow multiple processes to enter the critical section for a common session. One of the significant characteristics of the protocol is - concurrency, throughput and waiting time can be regulated adjusting the time period for which a session is declared. The minimum and the maximum number of messages to enter the CS is O and (n + 2) respectively where n is the total number of processes in the system. Moreover, simulation results show that the protocol, on average case, considerably reduces the number of messages per entry to the CS and also requires much lower waiting times. The maximum concurrency the protocol supports is n. The protocol also ensures no starvation in the system. Furthermore, this algorithm works out for the Extended Group Mutual Exclusion problem as well.

    AB - In this paper we present a new token based protocol for group mutual exclusion in distributed systems. The protocol uses one single token to allow multiple processes to enter the critical section for a common session. One of the significant characteristics of the protocol is - concurrency, throughput and waiting time can be regulated adjusting the time period for which a session is declared. The minimum and the maximum number of messages to enter the CS is O and (n + 2) respectively where n is the total number of processes in the system. Moreover, simulation results show that the protocol, on average case, considerably reduces the number of messages per entry to the CS and also requires much lower waiting times. The maximum concurrency the protocol supports is n. The protocol also ensures no starvation in the system. Furthermore, this algorithm works out for the Extended Group Mutual Exclusion problem as well.

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

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

    U2 - 10.1109/ISPDC.2006.4

    DO - 10.1109/ISPDC.2006.4

    M3 - Conference contribution

    AN - SCOPUS:34547513615

    SN - 0769526381

    SN - 9780769526386

    SP - 34

    EP - 41

    BT - Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006

    ER -