NDLI: Distributed mutual exclusion on hypercubes

Please wait, while we are loading the content...

Distributed mutual exclusion on hypercubes

Content Provider	ACM Digital Library
Author	Naimi, Mohamed
Abstract	Hypercube have been commercially available in the past few years to their high degree of connectivity, symmetry, and low degree of diameter. In this paper, we analyse the performance in number of messages on d-dimensional hypercube, for two groups of distributed algorithms for mutual exclusion, a permission-based mutual exclusion group, and a token-based mutual exclusion group.In the permission-based mutual exclusion algorithm, a node enters in the critical section only after receiving permission from all others nodes, this algorithm requires $d2^{d}$ messages.In the token-based mutual exclusion algorithm, a node is allowed to access its critical section if and only if it holds the token. In this algorithm, there is a node, called root, which knows the last node to get the token among the current requesting nodes. When a node wants to enter critical section, it sends request message to the root, which in turn informs the last node that new node will get the token next, and updates its last node. As result, the requesting nodes form a distributed queue, each of which records only the element next to it, this algorithm requires 2d messages in the worst case.
Starting Page	46
Ending Page	51
Page Count	6
File Format	PDF
ISSN	01635980
DOI	10.1145/230908.230917
Journal	ACM SIGOPS Operating Systems Review (OPSR)
Volume Number	30
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1975-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Distributed algorithm Hypercubes Efficient mutual exclusion algorithm
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Information Systems

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On mutual exclusion in faulty distributed systems

A note on Lamport's mutual exclusion algorithm

A dynamic request set based algorithm for mutual exclusion in distributed systems

Distributed mutual exclusion algorithms in mobile ad hoc networks:an overview

A simple taxonomy for distributed mutual exclusion algorithms

Distributed algorithm for K-entries to critical section based on the directed graphs

Proof of a mutual exclusion algorithm—a classic example

A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion

An efficient solution to the mutual exclusion problem using unfair and weak semaphore

Distributed mutual exclusion on hypercubes

Similar Documents

On mutual exclusion in faulty distributed systems

A note on Lamport's mutual exclusion algorithm

A dynamic request set based algorithm for mutual exclusion in distributed systems

Distributed mutual exclusion algorithms in mobile ad hoc networks:an overview

A simple taxonomy for distributed mutual exclusion algorithms

Distributed algorithm for K-entries to critical section based on the directed graphs

Proof of a mutual exclusion algorithm—a classic example

A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion

An efficient solution to the mutual exclusion problem using unfair and weak semaphore

Distributed mutual exclusion on hypercubes