Title :
A continuous double auction method for resource allocation in computational grids
Author :
Izakian, Hesam ; Ladani, Behrouz Tork ; Zamanifar, Kamran ; Abraham, Ajith ; Snásel, Václav
Author_Institution :
Ramsar branch, Islamic Azad Univ., Ramsar
fDate :
April 2 2009-March 30 2009
Abstract :
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.
Keywords :
electronic commerce; grid computing; multi-agent systems; resource allocation; computational grids; consumer agents; continuous double auction method; earliest deadline first method; provider agents; resource allocation; Business; Environmental economics; Grid computing; Large-scale systems; Portals; Processor scheduling; Protocols; Resource management; System performance; Time factors;
Conference_Titel :
Computational Intelligence in Scheduling, 2009. CI-Sched '09. IEEE Symposium on
Conference_Location :
Nashville, TN
Print_ISBN :
978-1-4244-2757-4
DOI :
10.1109/SCIS.2009.4927011
