A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems

DOI10.1007/BF01798960MaRDI QIDQ757018zbMATH OpenOpenAlexFDO

Authors Mukesh Singhal

Publication date 1991

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01798960

zbMATH Keywords

performancemutual exclusionstarvationdeadlocksdynamic information structures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A distributed deadlock detection and resolution algorithm and its correctness proof
• Distributed Computing – IWDC 2005
• A distributed k-mutual exclusion algorithm using k-coterie
• A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network
• A token based \(k\)-resilient mutual exclusion algorithm for distributed systems

Cites work

• scientific article; zbMATH DE number 4003522 (Why is no real title available?)
• scientific article; zbMATH DE number 3308885 (Why is no real title available?)
• Distributed match-making
• Time, clocks, and the ordering of events in a distributed system

Cited in

(5)

• scientific article; zbMATH DE number 1860625 (Why is no real title available?)
• A class of high performance Maekawa-type algorithms for distributed systems under heavy demand
• Distributed Computing – IWDC 2005
• Distributed algorithms for multiple entries to a critical section with priority
• Symmetric and economical solutions to the mutual exclusion problem in a distributed system

This page was built for publication: A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems

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