By Topic

Performance Evaluation of gLite Grids through GSPNs

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

3 Author(s)
Bruneo, D. ; Dept. of Math., Univ. of Messina, Messina, Italy ; Scarpa, M. ; Puliafito, A.

Grid Computing supports the shared and coordinated use of several resources in dynamic Virtual Organizations. In the last few years, it is evolving into a business-innovating technology that is driving commercial adoption. Such a new scenario calls for powerful strategies able to guarantee stringent QoS requirements in order to meet Service Level Agreements (SLAs) between customers and providers. For this reason, it is necessary to analyze and predict performance with respect to different load conditions or management strategies. In this paper, we present a methodology to analyze performance in gLite Grids through the use of Generalized Stochastic Petri Nets (GSPNs). We introduce a cluster-level model of a typical gLite site taking into account the coexistence between normal and MPI-based jobs. We investigate the influence of different strategies (e.g., scheduling) on the performance of the whole site, highlighting aspects related to both customer and provider point of views. We also provide a business-oriented performance analysis introducing two different SLA typologies and highlighting how the site configuration may influence the expected profit of the service provider.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:21 ,  Issue: 11 )