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

DOI10.1007/BF01798960zbMath0723.68017OpenAlexW1971770999MaRDI QIDQ757018

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

performancedeadlocksmutual exclusionstarvationdynamic information structures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

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

Cites Work

• Distributed match-making
• Time, clocks, and the ordering of events in a distributed system
• Unnamed Item
• Unnamed Item

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