By Topic

A framework for resource allocation in grid computing

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
$33 $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)
D. A. Menasce ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; E. Casalicchio

Grid computing is the future computing paradigm for enterprise applications. An enterprise application running on a grid is composed of a set of SLA-constrained sub-tasks demanding different types of services and resources such as processors, data storage, service providers, and network links. The paper formalizes the resource allocation problem for SLA-constrained grid applications. The paper considers a very general case in which applications are decomposed into tasks that exhibit precedence relationships. The problem consists in finding the optimal resource allocation that minimizes total cost while preserving execution time service level agreements (SLAs). The paper provides a framework for building heuristic solutions for this NP-hard problem, presents an example of such a heuristic, and provides a numerical example.

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings. The IEEE Computer Society's 12th Annual International Symposium on

Date of Conference:

4-8 Oct. 2004