The Community for Technology Leaders
Cluster Computing and the Grid, IEEE International Symposium on (2009)
Shanghai, China
May 18, 2009 to May 21, 2009
ISBN: 978-0-7695-3622-4
pp: 4-11
ABSTRACT
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle allocation algorithm. During the auction, prices are iteratively negotiated and dynamically adjusted until market equilibrium is reached. The BarSAA algorithm features decentralized bidding decision making in a heterogeneous distributed environment so that scheduler can offload its duty onto participating computing nodes and significantly reduces scheduling overheads. When a BarSAA auction converges, the equilibrium point is {Pareto Optimal} and achieves social efficient outcome and double-sided revenue maximization. In addition, BarSAA promotes truthful behavior among selfish nodes. Through game theoretical analysis, we demonstrate that truthful revelation is beneficial to bidders in making bidding strategies. Extensive simulation results are presented to demonstrate the efficiency of the BarSAA strategy and validate several important analytical properties.
INDEX TERMS
Grid Computing, Game Theory, Combinatorial Auction, Peer-to-Peer Computing
CITATION

H. Zhao and X. Li, "Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction," Cluster Computing and the Grid, IEEE International Symposium on(CCGRID), Shanghai, China, 2009, pp. 4-11.
doi:10.1109/CCGRID.2009.86
86 ms
(Ver 3.3 (11022016))