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

New Algorithm for Resource Selection in Economic Grid with the Aim of Cost Optimization Using Learning Automata

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)
Sarhadi, A. ; Comput. Eng. Dept., Islamic Azad Univ. -Malayer Branch, Malayer, Iran ; Meybodi, M.R.

In economic computational grids, resources have prices and the users must pay for executing their applications. The user determines his deadline and budget and then requests cost or time optimization. A resource selection service that adopts cost optimization strategy should select heterogeneous grid resources for heterogeneous user applications so that their execution finishes in the specified deadline with minimum cost. In this paper, new algorithms based on learning automata are proposed for this purpose. Using computer simulations, it is shown that the proposed algorithms have higher performance comparing to the existing algorithm.

Published in:

Challenges in Environmental Science and Computer Engineering (CESCE), 2010 International Conference on  (Volume:1 )

Date of Conference:

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