The Bancomat problem: An example of resource allocation in a partitionable asynchronous system

DOI10.1016/S0304-3975(01)00398-XMaRDI QIDQ1870529zbMATHFDO

Authors Jeremy Sussman, Keith Marzullo

Publication date 14 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

partition-aware application

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• The assignment problem
• Application-based dynamic primary views in asynchronous distributed systems.
• On quorum systems for group resources allocation
• On Quorum Systems for Group Resources with Bounded Capacity
• Computational Science – ICCS 2005

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• On the impossibility of group membership
• Operating systems. An advanced course
• Specifying and using a partitionable group communication service
• Time, clocks, and the ordering of events in a distributed system
• Using process groups to implement failure detection in asynchronous environments

Cited in

(2)

• Dynamic load balancing with group communication
• Cooperative computing with fragmentable and mergeable groups

Describes a project that uses

Uses Software

• Horus

This page was built for publication: The Bancomat problem: An example of resource allocation in a partitionable asynchronous system

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