An Improved MIN-MIN Scheduling Algorithm

With the developping of hardware and software technology,it come to possible to excute parallel applications on a large-scale distributed resources. With the rise of the grid, Scheduling algorithms for these applications became a very active research area. Now, around the grid task scheduling algorithm, home and abroad have done a lot of research work and proposed variety of scheduling algorithms.Acroding the classic Min_Min Scheduling algorithm ,for the grid task itself and the properties of resources, adopted a method which specificed attribut parameter, selected representative of the relevant attributes, designed a constraint functions and a priority model, improved algorithm from different angles, proposed P-Min-Min Scheduling Algorithm. Finally, use the Gridsim Simulation Toolkit, achieved the relevant scheduling algorithm by improved java-related packages and Visua1 Moduler, do a systematic comparison and analysis based with a lot of data results from the Scheduling algorithm simulation, which demonstrates the effectiveness of the improved scheduling algorithm to solve similar problems.Through a summary of research results, explore the problems of the algorithm, pointed out the further research directions. The algorithm can coordination resources sharing among multiple users, to meet the needs of different users, give full consideration to the expectations of the different job completion time and through different levels of user settings for different priority levels,allows high priority users to give priority to the implementation of the operation,ensure that the vast majority of jobs in the expected completion time to be completed. At the same time balance the utilization of various resources and increased user satisfaction,achieve a reasonable resources match between the tasks and heterogeneous resources.