An auction method for resource allocation in computational grids

  • Authors:

  • Hesam Izakian;Ajith Abraham;Behrouz Tork Ladani

  • Affiliations:

  • Department of Computer Engineering, Faculty of Engineering, University of Isfahan, Isfahan, Iran and Machine Intelligence Research Labs - MIR Labs, Scientific Network for Innovation and Research E ...;Machine Intelligence Research Labs - MIR Labs, Scientific Network for Innovation and Research Excellence, P.O. Box 2259, Auburn, WA 98071, USA11http://www.mirlabs.org.;Department of Computer Engineering, Faculty of Engineering, University of Isfahan, Isfahan, Iran

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A computational grid is composed of a set of resource consumers and resources providers. Usually these entities are independent and making decisions autonomously based on their policies and resource allocation in such systems is a challenging problem. In such systems using market-like techniques for this problem regulates the supply and demand for resources, provides an incentive for providers, and motivates the users to trade-off between deadline, budget, and the required level of quality of service. In this paper, we introduce a continuous double auction method (CDA) for grid resource allocation in which resources are considered as provider agents and users as consumer agents. In our proposed method these entities are allowed to participate in a grid independently and make decisions autonomously. We study this method in terms of economic efficiency and system performance. Experimental results illustrate that the proposed method is efficient in terms of successful execution rates, resource utilization rates and fair profit allocation.