Affiliation:
1. Univ. of California, Santa Barbara
Abstract
Solutions to resource allocation problems and other related synchronization 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 for the resource allocation problem that achieves a constant failure locality of four along with a quadratic response time and a quadratic message complexity is presented. Applications of the algorithm to other process synchronization problems in distributed systems are also demonstrated.
Publisher
Association for Computing Machinery (ACM)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11
2. Distributed Mutual Exclusion Algorithms for Intersection Traffic Control;IEEE Transactions on Parallel and Distributed Systems;2015-01
3. Stabilizing Dining with Failure Locality 1;Distributed Computing and Networking;2014
4. A Generalized Mutual Exclusion Problem and Its Algorithm;2013 42nd International Conference on Parallel Processing;2013-10
5. TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks;Handbook of Optimization in Complex Networks;2011-09-29