|
Grid Task Scheduling is a high performance grid computing is an important research topic , scheduling strategies and algorithms directly affects the performance of the grid , the grid itself distributed , heterogeneous , dynamic, autonomous and other characteristics of the traditional scheduling algorithm presents new challenges, grid grid task scheduling algorithm become a hot research . Firstly, the concept of the grid , the grid classification, the characteristics of the grid , the grid architecture and other related issues are introduced , and then grid task scheduling objectives, principles and strategies were discussed, followed by an analysis of the classical grid task scheduling algorithm , from the grid task scheduling algorithm balance and optimize the performance of both emphatically analyzed Min-Min, Max-Min algorithm deficiencies and defects. For the heterogeneous nature of the grid , task scheduling and effective resource utilization load balancing performance improvement as the goal , we propose a task scheduling algorithm based on the traditional improved FILT grid task scheduling algorithm that uses heuristic thinking, according to the task set grid to analyze the distribution of tasks to filter out the task set , which makes the task on each resource rapid equilibrium , and then through iterative calculation , so that the grid system task on each machine quickly reach load balancing and efficient allocation of adequate resources , the final paper simulation experiments using scientific way to prove the correctness of the algorithm and performance advantages , this article Min-Min, Max-Min algorithm Benchmarking, using the grid scheduling simulation tool package GridSimToolkit done a lot of simulation experiments , the results showed that: the proposed based on Min-Min and Max-Min algorithm improved FILT algorithm has good performance, can get more than Min-Min, Max-Min algorithm is better scheduling result . In addition to research papers finally sum up the work , but also on future research directions are discussed.
|