skip to main content
10.1145/1066677.1066700acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Forming resource-sharing coalitions: a distributed resource allocation mechanism for self-interested agents in computational grids

Published:13 March 2005Publication History

ABSTRACT

Designing efficient resource allocation mechanism for computational grids is extremely challenging because the effective agents in computational grids are inherently self-interested due to their different ownerships. Providing incentive for agents to share their resource with others is the key to make computational grids realistic. The global efficiency should be generated through the interactions among agents from the bottom up. In game theory, forming coalition is such a cooperative game among self-interested agents. We develop a distributed resource allocation mechanism for computational grids by forming resource-sharing coalitions among self-interested agents through automated multiparty negotiation. This mechanism is based on a task-oriented mechanism for measuring the economic value of computational resource usage. The simulation results show that the self-interests of agents in computational grids have considerable impact on the decisions of each agent about how to allocate their resource to appropriate tasks.

References

  1. Berman, F., Fox, G. and Hey, T. (Editors), Grid Computing: Making The Global Infrastructure a Reality, John Wiley & Sons, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Buyya, R. Economic-Based Distributed Resource Management and Scheduling for Grid Computing. Ph.D. Dissertation, 2002.Google ScholarGoogle Scholar
  3. Caillou, P., Aknine, S. and Pinson, S., A Multi-Agent Method for Forming and Dynamic Restructuring of Pareto Optimal Coalitions, in proceedings of the First International Joint Conference on Autonomous Agents and Multi-agent Systems, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Clearwater, S. H.(Editor), Market-Based Control: A Paradigm for distributed resource allocation, World Scientific, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Foster, I. and Kesselman, C., The Grid: Blueprint for a New Computing Infrastructure, 1st edition, Morgan Kaufmann, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. He, L. and Ioerger, T. R., A Quantitative Model of Capabilities in Multi-Agent Systems, in Proceedings of the International Conference on Artificial Intelligence, 2003.Google ScholarGoogle Scholar
  7. He, L. and loerger, T. R., Combining Bundle Search with Buyer Coalition Formation in Electronic Markets: A Distributed Approach through Explicit Negotiation. The Sixth International Conference on Electronic Commerce, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Kahan, J. P. and Rapoport, A., Theories of Coalition Formation, Lwarence Erlbaum Associates, Inc., London, 1984.Google ScholarGoogle Scholar
  9. Kraus, S., Strategic Negotiation in Multiagent Environments, The MIT Press, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Lan, Z., Taylor, V. and Bryan, G., A Novel Dynamic Load Balancing Scheme for Parallel Systems, Journal of Parallel and Distributed Computing, Vol 62/12, pp. 1763--1781, 2002 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Lerman, K. and Shehory, O., Coalition formation for largescale electronic markets, in proceedings of the International Conference on Multi-Aent Systems, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Li, C. and Sycara, K., Algorithm for combinatorial coalition formation and payoff division in an electronic marketplace, in proceedings of the First International Joint Conference on Autonomous Agents and Multi-agent Systems (AAMAS), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Proter, M. E., Competitive Strategy, The Free Press, New York, 1980.Google ScholarGoogle Scholar
  14. Rosenschein, J. S. and Zlotkin, G., Rules of Encounter: Designing Conventions for Automated Negotiation among Computers, The MIT Press, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Sandholm, T. Making Markets and Democracy Work: A Story of Incentives and Computing, in Proceedings of IJCAI, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Sandholm, T., Larson, K., Andersson, M., Shehory, O. and Tohme F., Coalition structure generation with worst case guarantees, Artificial Intelligence Journal, Vol (111), 209--238, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Sandholm, T., Negotiation among Self-Interested Computationally Limited Agents, Ph.D. Dissertation, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Sandholm, T. and Lesser, V., Leveled Commitment Contracting: A Backtracking Instrument for Multiagent Systems. AI Magazine 23 (3): 89--100, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Shehory, O. and Kraus, S., Feasible formation of coalitions among autonomous agents in non-super-additive environments, Computational Intelligence, vol. 15(3), 218--251, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  20. Shehory, O. and Kraus, S., Methods for task allocation via agent coalition formation, Artificial Intelligence Journal, Vol. 101 (1--2), May, pages 165--200, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Tesfatsion, L., Agent-based computational economics: Growing economies from the bottom up. Artificial Life, 8:55--82, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Wolski, R., Brevik, J., Plank, J., and Bryan, T., Grid Resource Allocation and Control Using Computational Economies, In Grid Computing: Making the Global Infrastructure a Reality Berman, F, Fox, G., and Hey, T. editors, Wiley and Sons, pp. 747--772, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  23. Wolski, R., Plank, J. S., Brevik, J. and Bryan, T. Analyzing market-based resource allocation strategies for the computational Grid. International Journal of High Performance Computing Applications, 15(3):258--281, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SAC '05: Proceedings of the 2005 ACM symposium on Applied computing
    March 2005
    1814 pages
    ISBN:1581139640
    DOI:10.1145/1066677

    Copyright © 2005 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 13 March 2005

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader