融合遗传算法和蚁群算法动态网格任务调度算法研究

Genetic Algorithm and Ant Colony Algorithm for Dynamic Grid Task Scheduling

网格计算是当今计算机科学领域最新兴起的一项有很高学术价值和应用价值的研究课题。未来互联网的发展方向是将网络中众多闲置的计算资源、存储资源以及科学仪器等可用资源充分合理的加以利用。如何高效地使用网格资源,即网格调度问题也随之成为研究的重点,虽然在传统的分布式并行计算中有很多成熟的任务调度算法,但由于网格的新特性,使得必须研究新的算法来解决一些新出现的问题,如调度问题的NP安全性,调度算法的高效性,资源的异构性以及资源分配决策的并行性和分布性等。

How efficient use of grid resources,grid scheduling problem that will become a focus of the study,although in traditional distributed and parallel computing,there are many sophisticated task scheduling algorithm,but because of the new features of the grid,made it necessary to study new algorithms to solve new problems,such as the scheduling problem NP security,efficient scheduling algorithms,resource heterogeneity and resource allocation decisions,parallel and distributed and so on.