Analysis of Query Matching Criteria and Resource Monitoring Models for Grid Application Scheduling

  • Authors:

  • Ronak Desai;Sameer Tilak;Bhavin Gandhi;Michael J. Lewis;Nael B. Abu-Ghazaleh

  • Affiliations:

  • State University of New York, Binghamton, USA;State University of New York, Binghamton, USA;State University of New York, Binghamton, USA;State University of New York, Bingham, USA;State University of New York, Binghamton, USA

  • Venue:
  • CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Making effective use of computational Grids requires scheduling Grid applications onto resources that best match them. Resource-related state (e.g., load, availability, and location), and demand-related state (number and distribution of application resource requests) influence scheduling decision success. The scale of the Grid makes collecting and maintaining detailed up-to-date state information for all resources and requests impractical. Thus, concurrent distributed schedulers must make scheduling decisions based on incomplete resource state information. In this paper, we evaluate the effect that the criteria for selecting scheduling matches have on the success of scheduling decisions. We focus on three criteria: information freshness, resource distance from requesters, and past behavior. We evaluate the quality of the schedule for various resource monitoring models, Grid load models, and Grid overlay topologies. Among our findings is the counter-intuitive result that favoring freshness can sometimes harm overall system performance; a combination of resource distance and past scheduling success performs best. We also evaluate a pure resource state pull model with caching, and discover that pro-actively pushing dynamic state information to schedulers is beneficial.