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

DOI10.1016/J.JPDC.2007.02.005MaRDI QIDQ2373889zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Distributed algorithms (68W15)

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

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
• scientific article; zbMATH DE number 1728280 (Why is no real title available?)

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)