A distributed resource allocation algorithm for many processes

DOI10.1007/s00236-013-0181-7zbMath1362.68215arXiv1204.6170OpenAlexW2134926993MaRDI QIDQ378202

Wim H. Hesselink

Publication date: 11 November 2013

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.6170

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Uses Software

• SPIN

Cites Work

• The existence of refinement mappings
• Stabilizing mobile philosophers
• Upper bounds for static resource allocation in a distributed system
• A modular drinking philosophers algorithm
• Splitting forward simulations to cope with liveness
• A new solution of Dijkstra's concurrent programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A distributed resource allocation algorithm for many processes