Auction-based resource allocation protocols in grids.

摘要

Resource management is a key issue in Grid Computing. It is difficult to design an optimal resource allocation mechanism for a Grid which meet the objectives of end users as well as resource owners. To address this complex problem, we rely on economic-based resource allocation mechanisms.; The auction model is one of the most commonly studied economic models in the context of resource management in distributed systems. The advantage of using auctions for resource allocation is that they require little global information, have decentralized structure and are easy to implement. In this thesis an auction allocation model, and three auction-based protocols: First-Price Auction, Vickrey Auction, and Double Auction are presented. The three protocols are simulated using the SimGrid simulation framework and studied in terms of economic efficiency and system performance.; A different class of auctions called combinatorial auctions is also discussed. A combinatorial auction allocation model and combinatorial auction based resource allocation protocol are presented. The protocol is simulated using the SimGrid simulation framework and evaluated in terms of economic efficiency and system performance. The winner determination problem in the combinatorial auction is solved using an approximate algorithm.