### A highly concurrent algorithm for the group mutual exclusion problem.A highly concurrent algorithm for the group mutual exclusion problem.

Access Restriction
Open

 Author Takamura, Masataka ♦ Igarashi, Yoshihide Source CiteSeerX Content type Text File Format PDF
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Group Mutual Exclusion Problem ♦ Highly Concurrent Algorithm ♦ Group Mutual Exclusion ♦ Mutual Exclusion Problem ♦ Ticket Order ♦ Adifferent Group ♦ Ahighly Concurrent Algorithm ♦ Bakery Algorithm ♦ Single Writer ♦ Prob Mathrm Mathrm Mathrm ♦ Asyn-chronous Shared Memory Model ♦ Philosopher Problem ♦ Interesting Generalization ♦ Mutual Exclusion Algorithm Abstract Group mutual exclusion is an interesting generalization of the mutual exclusion problem. This problem was introduced by Joung, and some algorithms for the prob-$\mathrm{l}\mathrm{e}\mathrm{m}$ have been proposed by incorporating mutual exclusion algorithms. Group mutual exclusion occurs naturally in asituation where aresource can be shared by processes of the same grouP, but not by processes of adifferent group. It is also called the congenial talking philosophers problem. In this paper we propose ahighly concurrent algorithm based on ticket orders for the group mutual exclusion problem in the asyn-chronous shared memory model. It is amodification of the Bakery algorithm for the mutual exclusion problem. It uses single writer shared variables together with two multi-writer shared variables that are never concurrently written. We show that the algorithm satisfies lockout freedom as well as group mutual exclusion. 1 Educational Role Student ♦ Teacher Age Range above 22 year Educational Use Research Education Level UG and PG ♦ Career/Technical Study Learning Resource Type Article