Abstract
The resource allocation problem is one of the fundamental problems for conflict resolution in distributed systems. In this paper, we consider the (n,m,k,d)-resource allocation problem, proposed by Joung [Joung, Distributed Computing (2010)], which is a generalization of the k-mutual exclusion problem and the group mutual exclusion problem. We propose a fully distributed solution based on tokens for the (n,m,k,d)-resource allocation problem for asynchronous message passing distributed systems. Previous works allow a process to request only one resource at a time. In our algorithm, the amount of resources that a process may request is arbitrary. The algorithm is designed based on leader-follower scheme, and permission to access resources is granted by tokens. The first process that requests resources becomes the leader, and then, other processes become followers and they are granted their requests by the leader. The message complexity of the proposed algorithm is bounded by O(|Q|) in the worst case and O(1) in the best case, where |Q| is the size of quorums of a coterie that the algorithm uses.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kakugawa, H., Fujita, S., Yamashita, M., Ae, T.: A distributed k-mutual exclusion algorithm using k-coterie. Information Processing Letters 49(2), 213–218 (1994)
Joung, Y.J.: Ashynchronous group mutual exclusion. Distributed Computing 13, 189–206 (2000)
Joung, Y.J.: On quorum systems for group resources allocation. Distributed Computing 22, 197–214 (2010)
Maekawa, M.: A \(\sqrt{N}\) algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)
Barbara, D., Garcia-Molina, H.: The reliability of voting mechanisms. IEEE Transactions on Computers C-36(10), 1197–1208 (1987)
Agrawal, D., Abbadi, A.E.: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Compututer Systems 9(1), 1–20 (1991)
Kumar, A.: Hierarchical quorum consensus: a new algorithm for managing replicated data. IEEE Transactions on Computers 40(9), 996–1004 (1991)
Neilsen, M.L., Mizuno, M.: Coterie join algorithm. IEEE Transactions on Parallel and Distributed Systems 3(5), 582–590 (1992)
Peleg, D., Wool, A.: Crumbling walls: a class of practical and efficient quorum systems. Distributed Computing 10, 87–97 (1997)
Raynal, M.: A simple taxonomy for distributed mutual exclusion algorithms. ACM Operating Systems Review 25(2), 47–51 (1991)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer network. Communications of the ACM 24(1), 9–17 (1981)
Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems 3(4), 344–349 (1985)
Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. Journal of the ACM 32(4), 841–860 (1985)
Manabe, Y., Baldoni, R., Raynal, M., Aoyagi, S.: k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion. Theoretical Computer Science 193(1-2), 97–112 (1998)
Joung, Y.J.: Quorum-based algorithms for group mutual exclusion. IEEE Transactions on Parallel and Distributed Systems 14(5), 463–476 (2003)
Mittal, N., Mohan, P.K.: A priority-based distributed group mutual exclusion algorithm when group access is non-uniform. Journal of Parallel and Distributed Computing 67, 797–815 (2007)
Atreya, R., Mittal, N., Peri, S.: A quorum-based group mutual exclusion algorithm for a distributed system with dynamic group set. IEEE Transactions on Parallel and Distributed Systems 18(10), 1345–1360 (2007)
Kakugawa, H., Kamei, S., Masuzawa, T.: A token-based distributed group mutual exclusion algorithm with quorums. IEEE Transactions on Parallel and Distributed Systems 19, 1153–1166 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kakugawa, H., Kamei, S. (2010). A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem. In: Lu, C., Masuzawa, T., Mosbah, M. (eds) Principles of Distributed Systems. OPODIS 2010. Lecture Notes in Computer Science, vol 6490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17653-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-17653-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17652-4
Online ISBN: 978-3-642-17653-1
eBook Packages: Computer ScienceComputer Science (R0)