Efficient fault tolerant algorithms for resource allocation in distributed systems

Authors:
Manhoi Choy;Ambuj K. Singh
Affiliations:
Department of Computer Science, University of California at Santa Barbara, Santa Barbara, California;Department of Computer Science, University of California at Santa Barbara, Santa Barbara, California
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 9
Cited 11

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The butterfly barrier

International Journal of Parallel Programming
Parallel program design: a foundation

Parallel program design: a foundation
Improved algorithms for distributed resource allocation

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Software combining algorithms for distributing hot-spot addressing

Journal of Parallel and Distributed Computing
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast allocation of nearby resources in a distributed system

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributed algorithms for ensuring fair interprocess communicatons

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

What can be computed locally?

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient asynchronous distributed symmetry breaking

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Guaranteeing fair service to persistent dependent tasks

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scheduling with conflicts, and applications to traffic signal control

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Distributed long-lived list colouring: how to dynamically allocate frequencies in cellular networks

Wireless Networks
Fault-Tolerant Algorithms for Fair Interprocess Synchronization

IEEE Transactions on Parallel and Distributed Systems
A General Resource Allocation Synchronization Problem

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A modular algorithm for resource allocation

Distributed Computing
Efficient multi-word locking using randomization

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A modular drinking philosophers algorithm

Distributed Computing
Distributed coloring in Õ (√log n) Bit Rounds

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solutions to resource allocation problems in distributed systems are examined with respect to the measures of response time, message complexity, and failure locality. Response time measures the time it takes for an algorithm to respond to the requests of a process, message complexity measures the number of messages sent and received by a process, and failure locality characterizes the size of the network that is affected by the failure of a single process. An algorithm that achieves a constant failure locality of four along with a quadratic response time and a quadratic message complexity is presented.