A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

DOI10.1016/J.JPDC.2007.02.005zbMATH Open1121.68124OpenAlexW2168475295MaRDI QIDQ2373889FDOQ2373889

Authors: Neeraj Mittal, Prajwal K. Mohan 

Publication date: 16 July 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.02.005

Recommendations

• Asynchronous group mutual exclusion
• Group mutual exclusion algorithms based on ticket orders
• scientific article; zbMATH DE number 2006641
• Fair group mutual exclusion
• Space-efficient FCFS group mutual exclusion

zbMATH Keywords

resource managementmessage-passing systemtoken-based algorithmgroup mutual exclusionnon-uniform group selectionpriority-based scheme

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited In (5)

• Distributed algorithms for multiple entries to a critical section with priority
• A class of high performance Maekawa-type algorithms for distributed systems under heavy demand
• Asynchronous group mutual exclusion
• Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem
• Title not available (Why is that?)

This page was built for publication: A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373889)