Quorum Based Algorithms using Group Choice

  • Park, Jae-Hyrk (International Research Center for Information Security(IRIS) Information Communication Univ.) ;
  • Kim, Kwangjo (International Research Center for Information Security(IRIS) Information Communication Univ.) ;
  • Yoshifumi Manabe (Nippon Telegraph and Telephone Corporation, Japan)
  • Published : 2002.11.01

Abstract

This paper discusses the quorum based algorithm for group mutual exclusion defined by Yuh-Jzer Joung. Group mutual exclusion[4,5,6] is a generalization of mutual exclusion that allows a resource to be shared by processes of the same group, but requites processes of different groups to use the resource in a mutually exclusive style. Joung proposed a quorum system, which he referred to as the surficial quorum system for group mutual exclusion and two modifications of Maekawa's algorithm[6]. He mentioned that when a process may belong to more than one group, the process must identify one of the groups it belongs when it wishes to enter CS(Critical Section). However, his solution didn't provide mechanism of identifying a group which maximizes the possibility to enter CS. In this paper, we provide a mechanism for identifying that each process belongs to which group.

Keywords