Work

An O(√n) Distributed Mutual Exclusion Algorithm Using Queue Migration

Year: 2020

Type: article

Abstract: In this paper a distributed algorithm is proposed that realises mutual exclusion among n nodes in a computer network. There is no common or global memory shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The proposed algorithm is based on queue migration and achieves a message complexity of O(√n) per mutual exclusion invocation. Under heavy load, the number of required messages approaches 2 per mutual exclusion.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.3217/jucs-012-02-0140

Authors: Pranay Chaudhuri, Thomas Edward

Institution: University of the West Indies

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4292013339

FWCI: 0.106

Cites:

Cited by: 4

Related to: 10