一种基于双向拍卖机制的计算网格资源分配方法

A Double Auction Method for Resource Allocation on Computational Grids

针对计算网格资源的特点以及运用经济机制进行网格资源管理所具有的灵活性及有效性,提出一种改进的基于双向拍卖机制的网格资源分配方法.首先,描述了基于双向拍卖机制的资源分配框架,整个系统由买方、卖方和计算资源经纪人组成.然后,针对网格中的CPU资源,提出一种改进的双向拍卖机制,采用统一拍卖方式,可以灵活调节交易双方的付费.进而,分析了该双向拍卖机制满足优势策略激励相容、预算平衡以及个人理性的特点,并定义了拍卖机制的效率.最后,通过实验分析了双向拍卖分配机制的效率.

Considering dynamic, heterogeneous and autonomous characteristics of computing resources in the computational grid environment and the flexibility and effectivity of economics methods applied to solve the problem of resource management, a modified double auction method for resource allocation on computational grids is presented. Firstly, a double auction framework for resource allocation in the computational grid environment is described, which consists of buyers, sellers and one market maker. Secondly, a modified double auction mechanism is presented, where the uniform auction is adopted aiming at CPU resources, and the transaction fee can be adjusted flexibly. Thirdly, the property of the presented double auction mechanism is discussed, and the presented double auction mechanism proves to satisfy dominant strategy incentive compatibility, budget balance, and individual rationale, in addition the efficiency of the double auction mechanism is defined. Finally, the efficiency of the presented double auction mechanism is analyzed through experiments, and experimental results show that the efficiency of the presented double auction mechanism increases as the number of buyers and sellers increases, and indicate that the presented double auction mechanism is suitable for large-scale grid computing systems. Moreover, the difference between the number of sellers and the number of buyers can also have influence on the efficiency.