A Research Of Economic-based Approaches To Supporting Advance Reservation In Grid Environment

Grid is a new technology that enables a large number of users to share the same distributed resources, such as high-performance computers, network-supported database and instrument. However, the resources in the Grid are owned by different users or organizations, so it is necessary that economic-based methods be employed for the realization of resource sharing. In addition, Grid provides a highly dynamic environment in which the services available and the requests of the users may change continuously, plus that the resources in the Grid are not storable, so it implies that today's computing capacity can not survive till a far future. Therefore, it is necessarily emphasized that the resources should be reserved in advance. Despite the fact that reservation of resources in advance can be viewed as one of the functions in scheduling, it is more concerned with users actively comparing and selecting resources, instead of being passively scheduled by the operating systems. Taking this into account, the design of users' reservation strategies along with interactions between these strategies decides whether or not the user could reserve the satisfying resources.This paper is mainly to explore an appropriate economic-based resource reservation mechanism which is based on definitions of the states of the Advance Reservation of the Grid. Besides, on the basis of Resource Allocation Agreement Protocol Working Group (GRAAP-WG), and taking into careful consideration the selectability, hierarchy and dynamics that are characteristic of Grid resources, concerns will be given to behaviors of the rational users and the system performance influenced these behaviors. Main research work and contributions of this paper are illustrated as follows:1. A mathematic model is investigated under the condition of multiple resource providers, with foci on the comparison of the economics features, and the complexity when computing the winner determination algorithm in main auction protocols which include: the multiple simultaneous ascending auction, multiple sequential ascending...