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

DOI10.1016/S0304-3975(01)00398-XzbMATH Open1026.68008MaRDI QIDQ1870529FDOQ1870529

Authors: Jeremy Sussman, Keith Marzullo 

Publication date: 14 May 2003

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

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

zbMATH Keywords

partition-aware application

Mathematics Subject Classification ID

Network protocols (68M12)

Cites Work

• Title not available (Why is that?)
• Time, clocks, and the ordering of events in a distributed system
• Specifying and using a partitionable group communication service
• Operating systems. An advanced course
• On the impossibility of group membership
• 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

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)