Relaxed-criteria G-negotiation for Grid resource co-allocation

  • Authors:
  • Kwang Mong Sim

  • Affiliations:
  • Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, KLN, Hong Kong

  • Venue:
  • ACM SIGecom Exchanges
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Supporting resource co-allocation is essential for realizing the Grid vision because computational intensive applications may require more resources than a single computing machine can provide in one administrative domain. Given that the various stakeholders often have their own requirements and supply-and-demand patterns, successfully obtaining commitments through concurrent negotiations with multiple resource owners to simultaneously access several resources is a very challenging task. This position paper (i) suggests that a relaxed-criteria G-negotiation mechanism may be used to enhance the success rates of negotiation agents in Grid resource co-allocation, (ii) proposes a testbed for realizing the relaxed-criteria G-negotiation mechanism, (iii) discusses experimental designs for evaluating the proposed mechanism, and (iv) discusses previous results obtained from using a relaxed-criteria G-negotiation protocol for Grid resource allocation.