By Topic

A Pareto Frontier for Optimizing Data Transfer and Job Execution in Grids

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)
Taheri, J. ; Sch. of Inf. Technol., Univ. of Sydney, Sydney, NSW, Australia ; Zomaya, A.Y.

This work presents a Genetic Algorithm (GA) based optimization technique, called GA-ParFnt, to find the Pareto frontier for optimizing data transfer versus job execution time in grids. As the performance of a generic GA is not suitable to find such Pareto relationship, several modifications are applied to it so that it can efficiently discover such relationship. The frontier curve representing this relationship is then matched against performance of several scheduling techniques - for both data intensive and computationally intensive applications -to measure their overall performances. Results show that several of these algorithms are far from the Pareto front despite their claims of being efficient in optimizing their targeted objectives. Results also provide invaluable insights into this formidable problem and should aid in the design of future schedulers.

Published in:

Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International

Date of Conference:

21-25 May 2012