Skip to main content
SpringerLink
Log in
Book cover

International Conference On Principles Of Distributed Systems

OPODIS 2010: Principles of Distributed Systems pp 411–426Cite as

A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem

  • Conference paper

  • 777 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6490))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Article  MATH  Google Scholar 

  2. Joung, Y.J.: Ashynchronous group mutual exclusion. Distributed Computing 13, 189–206 (2000)

    Article  Google Scholar 

  3. Joung, Y.J.: On quorum systems for group resources allocation. Distributed Computing 22, 197–214 (2010)

    Article  MATH  Google Scholar 

  4. Maekawa, M.: A \(\sqrt{N}\) algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)

    Article  Google Scholar 

  5. Barbara, D., Garcia-Molina, H.: The reliability of voting mechanisms. IEEE Transactions on Computers C-36(10), 1197–1208 (1987)

    Article  MathSciNet  Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. Kumar, A.: Hierarchical quorum consensus: a new algorithm for managing replicated data. IEEE Transactions on Computers 40(9), 996–1004 (1991)

    Article  Google Scholar 

  8. Neilsen, M.L., Mizuno, M.: Coterie join algorithm. IEEE Transactions on Parallel and Distributed Systems 3(5), 582–590 (1992)

    Article  MathSciNet  Google Scholar 

  9. Peleg, D., Wool, A.: Crumbling walls: a class of practical and efficient quorum systems. Distributed Computing 10, 87–97 (1997)

    Article  MATH  Google Scholar 

  10. Raynal, M.: A simple taxonomy for distributed mutual exclusion algorithms. ACM Operating Systems Review 25(2), 47–51 (1991)

    Article  Google Scholar 

  11. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  12. Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer network. Communications of the ACM 24(1), 9–17 (1981)

    Article  MathSciNet  Google Scholar 

  13. Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems 3(4), 344–349 (1985)

    Article  Google Scholar 

  14. Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. Journal of the ACM 32(4), 841–860 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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)

    Article  MathSciNet  MATH  Google Scholar 

  16. Joung, Y.J.: Quorum-based algorithms for group mutual exclusion. IEEE Transactions on Parallel and Distributed Systems 14(5), 463–476 (2003)

    Article  Google Scholar 

  17. 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)

    Article  MATH  Google Scholar 

  18. 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)

    Article  Google Scholar 

  19. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Osaka University, Suita, Osaka, Japan

    Hirotsugu Kakugawa

  2. Hiroshima University, Higashihiroshima, Hiroshima, Japan

    Sayaka Kamei

Authors
  1. Hirotsugu Kakugawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sayaka Kamei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Washington University, Campus Box 1045, One Brookings Drive, 63130, St. Louis, MO, USA

    Chenyang Lu

  2. Osaka University, Japan

    Toshimitsu Masuzawa

  3. LaBRI, University of Bordeaux, 351 cours de la Libération, 33405, Talence, France

    Mohamed Mosbah

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation