Grid Computing based on Game Optimization Theory for Networks Scheduling

Abstract

The resource sharing mechanism is introduced into grid computing algorithm so as to solve complex computational tasks in heterogeneous network-computing problem. However, in the Grid environment, it is required for the available resource from network to reasonably schedule and coordinate, which can get a good workflow and an appropriate network performance and network response time. In order to improve the performance of resource allocation and task scheduling in grid computing method, a game model based on non-cooperation game is proposed. Setting the time and cost of user's resource allocation can increase the performance of networks, and incentive resource of networks uses an optimization scheduling algorithm, which minimizes the time and cost of resource scheduling. Simulation experiment results show the feasibility and suitability of model. In addition, we can see from the experiment result that model-based genetic algorithm is the best resource scheduling algorithm.

Accuracy Assessment of the Effect of Different Feature Descriptors on the Automatic Co-Registration of Overlapping Images

“…Since the images of a large area or object are often acquired in small patches depending on the sensor used for the image data acquisition, often, there is the need to fuse those patches into larger pictures for wider view. Also, images are visual models of the reality and unless they are registered onto the object, realistic measurements cannot be derived from them, hence, they must be mosaicked or pixel by pixel comparison is to be made on more than one image which represents the same scene (Xiaolong & Siamak, 1999;Zhang et al, 2014).…”