By Topic

A continuous double auction method for resource allocation in computational grids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Izakian, H. ; Ramsar branch, Islamic Azad Univ., Ramsar ; Ladani, B.T. ; Zamanifar, K. ; Abraham, A.
more authors

In this paper, we introduce a continuous double auction method for grid resource allocation in which resources are considered as provider agents and users as consumer agents. In each time step, each provider agent determines its requested value based on its workload and each consumer agent determines its bid value based on two constraints: the remaining time for bidding, and the remaining resources for bidding. We study this method in terms of economic efficiency and system performance. Experimental results show that the proposed method is better than earliest deadline first (EDF) method, which is a default strategy in many schedulers.

Published in:

Computational Intelligence in Scheduling, 2009. CI-Sched '09. IEEE Symposium on

Date of Conference:

April 2 2009-March 30 2009