Article

The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System

Authors:

Jeremy B. Sussman,

Keith MarzulloAuthors Info & Claims

DISC '98: Proceedings of the 12th International Symposium on Distributed Computing

Pages 363 - 377

Published: 24 September 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Dolev SSchiller EWelch J(2006)Random Walk for Self-Stabilizing Group Communication in Ad Hoc NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2006.1045:7(893-905)Online publication date: 1-Jul-2006
https://dl.acm.org/doi/10.1109/TMC.2006.104
Dolev SSegala RShvartsman A(2006)Dynamic load balancing with group communicationTheoretical Computer Science10.1016/j.tcs.2006.09.020369:1(348-360)Online publication date: 15-Dec-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.09.020
Jacobsen KZhang XMarzullo K(2003)Group Membership and Wide-Area Master-Worker ComputationsProceedings of the 23rd International Conference on Distributed Computing Systems10.5555/850929.851918Online publication date: 19-May-2003
https://dl.acm.org/doi/10.5555/850929.851918
Show More Cited By

Index Terms

The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System

Recommendations

The Bancomat problem: an example of resource allocation in a partitionable asynchronous system
Special issue: Distributed computing

A partition-aware application is an application that can make progress in multiple connected components. In this paper, we examine a particular partition-aware application to evaluate the properties provided by different partitionable group membership ...
An Algorithm for the Equipollent Resource Allocation Problem

<P>The equipollent resource allocation problem asks to allocate a given amount of discrete resources to a given set of activities so that the maximum of the profit differences between activities is minimized. A typical example of this type of allocation ...
Modelling and solving grid resource allocation problem with network resources for workflow applications

A problem of allocating resources of a grid to workflow applications is considered. The problem consists, generally, in allocating distributed grid resources to tasks of a workflow in such a way that the resource demands of each task are satisfied. Grid ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

DISC '98: Proceedings of the 12th International Symposium on Distributed Computing

September 1998

418 pages

ISBN:3540650660

Editor:
Shay Kutten

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 24 September 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dolev SSchiller EWelch J(2006)Random Walk for Self-Stabilizing Group Communication in Ad Hoc NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2006.1045:7(893-905)Online publication date: 1-Jul-2006
https://dl.acm.org/doi/10.1109/TMC.2006.104
Dolev SSegala RShvartsman A(2006)Dynamic load balancing with group communicationTheoretical Computer Science10.1016/j.tcs.2006.09.020369:1(348-360)Online publication date: 15-Dec-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.09.020
Jacobsen KZhang XMarzullo K(2003)Group Membership and Wide-Area Master-Worker ComputationsProceedings of the 23rd International Conference on Distributed Computing Systems10.5555/850929.851918Online publication date: 19-May-2003
https://dl.acm.org/doi/10.5555/850929.851918
Georgiou CRussell AShvartsman ALarmore LGoemans M(2003)Work-competitive scheduling for cooperative computing with dynamic groupsProceedings of the thirty-fifth annual ACM symposium on Theory of computing10.1145/780542.780581(251-258)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/780542.780581
Chockler GKeidar IVitenberg R(2001)Group communication specificationsACM Computing Surveys10.1145/503112.50311333:4(427-469)Online publication date: 1-Dec-2001
https://dl.acm.org/doi/10.1145/503112.503113

Abstract

Cited By

Index Terms

Recommendations

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

An Algorithm for the Equipollent Resource Allocation Problem

Modelling and solving grid resource allocation problem with network resources for workflow applications

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations