Close category search window
 

The Scheduling Strategy of Divisible Task in Virtual Computing Environment

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

4 Author(s)
Hong Liang ; Comput. & Commun. Dept., China Univ. of Pet., Dongying, China ; Wenxing Wang ; Lun Wu ; Jun Wu

With the development of technology, calculated amount especially in seismic data processing is increasing in virtual computing environment and the data size is astonishing. In this paper, based on the seismic data and the influence factors during the calculation, we present a suitable data partitioning strategy-the PGA (Pretreatment Genetic Algorithm) algorithm. The scheduling problem in virtual computing environment has been proved to be an NP_Hard problem. We introduce the analytic hierarchy process (AHP) to achieve rapid scheduling decisions and make the overall mission to be optimal.

Published in:
Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on

Date of Conference: 13-15 Dec. 2010

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.