Cart (Loading....) | Create Account
Close category search window
 

A New Grid Computation-Based Min-Min Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaogao Yu ; Sch. of Inf. Manage., HuBei Univ. of Econ., Wuhan, China ; Xiaopeng Yu

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.

Published in:

Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on  (Volume:1 )

Date of Conference:

14-16 Aug. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.