• DocumentCode
    2843977
  • Title

    A resource mapping method in Grids based on multi-unit auction mechanism

  • Author

    Lan, Zhao ; Dazhen, Wang

  • Author_Institution
    Hubei Univ. of Technol., Wuhan, China
  • fYear
    2009
  • fDate
    17-19 June 2009
  • Firstpage
    5648
  • Lastpage
    5653
  • Abstract
    Whereas Grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing Grid resources is a complex undertaking. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. Since applications may require multiple Grid services, mechanisms such as single-good auctions may not be appropriate for the management of these services, we propose a new scheduling algorithm based on multi-unit auction. We provide the design of prices announcement, agent creation and resource situation submission, bidding rules, and temporary allocation rules. A simulation environment is established based on the Gridsim toolkit and the simulation experiments indicate that the algorithm needs less communication and meet the requirements of user´s QoS better than the conventional algorithms.
  • Keywords
    grid computing; quality of service; resource allocation; Gridsim toolkit; QoS; geographically distributed resources; large-scale problems; multi-unit auction mechanism; multiple Grid services; resource allocation mechanism; resource mapping method; Data engineering; Environmental economics; Grid computing; Large-scale systems; Power generation economics; Pricing; Procurement; Resource management; Scheduling algorithm; Technology management; Auction; Mechanism design; resource allocation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference, 2009. CCDC '09. Chinese
  • Conference_Location
    Guilin
  • Print_ISBN
    978-1-4244-2722-2
  • Electronic_ISBN
    978-1-4244-2723-9
  • Type

    conf

  • DOI
    10.1109/CCDC.2009.5195205
  • Filename
    5195205