A New Grid Computation-Based Min-Min Algorithm
Authors:
- 1 January 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 691, 43-45
Abstract
The traditional min-min algorithm is analyzed carefully based on the research of the existing mission scheduling algorithms of grid computation, and it is pointed out that the flaw of load unbalance exists in the min-min algorithm. An improved segmental method-based algorithm is introduced on the ground of min-min algorithm, on the contrary, whose flaw is solved efficiently by the improved algorithm inversely. The SF-min algorithm is introduced at the same time. At last, the introduced algorithm is simulated using Mathlab toolbox. The result proves the reasonableness of the improved algorithm and the algorithm is more efficacious and precise than current algorithms.Keywords
This publication has 7 references indexed in Scilit:
- The Research on an Adaptive Information Grid Architecture for Recommendation System2006
- A Knowledge-Based Approach for Semantic Service Composition2006
- The Research on An Adaptive K-Nearest Neighbors Classifier2006
- Modeling workflow processes with colored Petri netsComputers in Industry, 2002
- Web interface-driven cooperative exception handling in ADOME workflow management systemInformation Systems, 2001
- Coloured Petri Nets1997
- Modeling and enactment of workflow systems1993