Grid Computing Environment, The Dynamic Task Allocation And Scheduling Algorithm

Go with rapid development of computing science and broad application of network technology, Grid appears in the last few years. How to solve the large scale and complex computing problems utilizing resources in existence became a hot topic in computing field. Grid just is a technology to solve this problem. In twenty century 90's, a series of research and works spread. The grid combines parallel and distributed proceeding technology, and connects with and integrates the abundant resource in WAN passing through the high-speed network. The grid utilizes kinds of distributed and heterogeneous computers, large scale databases, scientific instruments and software systems, and it realizes distributed, parallel and alliance computing, achieving large scale computing problems in science field.The grid computing environment is a kind of heterogeneous computing environment, the dispatch for tasks in the environment can straightly influence performance of applications. A primary aim to parallel dispatch for tasks is to reach load balance, and take full advantage of the parallel systems' resource in running. In grid environment, the parallel systems inherent complexity, the mult-user environment and the large granularity of parallel tasks and so on, bring new difficulty to load balance. This article is absorbed in the aim how to balance load in grid environment and explore the dynamic dispatch to the parallel tasks in the process level, at last designs and realizes a dynamic dispatch system with PVM to load balance. This system adopts quiescent program analysis, self-adaptive data gathering and exchanging algorithm, and mult-users sharing and so on technologies. This system can improve the performance of applications running in grid environment, it have a better transparency, expansibility and portability and other wise features.