Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction

Free registration required

Executive Summary

To address coordination and complexity issues, the authors 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.

  • Format: PDF
  • Size: 359.96 KB