By Topic

Distributed algorithms for multiple mutual exclusion based on Maekawa's √N algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Mizuno ; Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA ; G. Sundar

Summary form only given. The authors have developed algorithms which expand Maekawa's √N algorithm to handle multiple mutual exclusion (AND-synchronization) problems, in which each node obtains mutually exclusive access to a set of resources rather than to a single resource. It involves suspending a requesting process until it successfully locks several resources simultaneously. Unlike a sequence of requests for (separate) single mutual exclusion, this approach prevents deadlock. Distributed multiple mutual exclusion algorithms can be used in many applications, such as updating a replicated database or as part of a deadlock-free two-phase lock protocol in a distributed environment. In a centralized system, two types of multiple mutual exclusion algorithms exist. One type of primitive (called a PBOTH primitive) prevents starvation, but resource utilization is low. Another type of primitive (called an SP/SV primitive) may cause starvation, but resource utilization is high. The authors have developed both types of distributed algorithms

Published in:

Computers and Communications, 1990. Conference Proceedings., Ninth Annual International Phoenix Conference on

Date of Conference:

21-23 Mar 1990