A strategy-proof combinatorial auction-based grid resource allocation system

  • Authors:
  • Yi Liang;Jianping Fan;Dan Meng;Ruihua Di

  • Affiliations:
  • Gird and distributed Computing Lab, Beijing University of Technology, National Research Center for Intelligent Computing System;Institute of Computing Technology, Chinese Academy of Sciences;Institute of Computing Technology, Chinese Academy of Sciences;Gird and distributed Computing Lab, Beijing University of Technology, National Research Center for Intelligent Computing System

  • Venue:
  • ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce a strongly strategy-proof combinatorial auction-based grid resource allocation system, called PheonixMarket. The key advantages of PheonixMarket are that it makes the scheduling with the time-varying job value information; guarantees the combinatorial allocation of heterogeneous resources, incents users to reveal true value information of their jobs, encourages users to contribute their redundant resources and avoids exceeding resource use by the baleful users. In the performance experiments, the economic efficiency of PheonixMarket is analyzed. We then measure the price sensitivity of PheonixMarket and make the load balance experiment based on its price 'signal'. Finally, the issue of taking the funding as a form of priority is measured in the experiments.