Stabilizing mobile philosophers

DOI10.1016/J.IPL.2005.03.006zbMath1185.68108OpenAlexW2069384591MaRDI QIDQ1041771

Michel Raynal, Maria Gradinariu, Ajoy K. Datta

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.006

zbMATH Keywords

algorithmsresource allocationfault tolerancedistributed computingself-stabilizationdynamic networkdining philosophers

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

A distributed resource allocation algorithm for many processes

Uses Software

• Chord

Cites Work

• Unnamed Item
• Asynchronous group mutual exclusion (extended abstract)
• Self-stabilizing systems in spite of distributed control
• The Driving Philosophers
• A new solution of Dijkstra's concurrent programming problem
• Active and Concurrent Topology Maintenance
• When graph theory helps self-stabilization

This page was built for publication: Stabilizing mobile philosophers