The POPCORN market.: online markets for computational resources
Decision Support Systems - Special issue on information and computational economics
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
SETI@home: an experiment in public-resource computing
Communications of the ACM
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
G-commerce: Market Formulations Controlling Resource Allocation on the Computational Grid
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Double Auction Protocols for Resource Allocation in Grids
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Combinatorial Auctions
Incentive mechanisms for large collaborative resource sharing
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Selfish grid computing: game-theoretic modeling and NAS performance results
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Fair Game-Theoretic Resource Management in Dedicated Grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
The performance of bags-of-tasks in large-scale distributed systems
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
SimGrid: A Generic Framework for Large-Scale Distributed Experiments
UKSIM '08 Proceedings of the Tenth International Conference on Computer Modeling and Simulation
A Meta-scheduler with Auction Based Resource Allocation for Global Grids
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
A taxonomy of peer-to-peer desktop grid paradigms
Cluster Computing
A survey of economic models in grid computing
Future Generation Computer Systems
A global benefit maximization task-bundle allocation
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
Market_based grid resource allocation using new negotiation model
Journal of Network and Computer Applications
The Journal of Supercomputing
Hi-index | 0.00 |
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.