Journal of Grid Computing

, Volume 1, Issue 1, pp 53–62

Simulation Studies of Computation and Data Scheduling Algorithms for Data Grids

  • Kavitha Ranganathan
  • Ian Foster
Article

DOI: 10.1023/A:1024035627870

Cite this article as:
Ranganathan, K. & Foster, I. Journal of Grid Computing (2003) 1: 53. doi:10.1023/A:1024035627870

Abstract

Data Grids seek to harness geographically distributed resources for large-scale data-intensive problems. Such problems, involving loosely coupled jobs and large data-sets, are found in fields like high-energy physics, astronomy and bioinformatics. A variety of factors need to be considered for effective scheduling of resources in such environments: e.g., resource utilization, response time, global and local allocation policies and scalability. We propose a general and extensible scheduling architecture that addresses these issues. Within this architecture we develop a suite of job scheduling and data replication algorithms that we evaluate using simulations for a wide range of parameters. Our results show that it is important to evaluate the combined effectiveness of replication and scheduling strategies, rather than study them separately. More specifically, we find that scheduling jobs to locations that contain the data they need and asynchronously replicating popular data-sets to remote sites, works rather well.

data replicationdistributed computinggrid computingschedulingsimulation

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Kavitha Ranganathan
    • 1
  • Ian Foster
    • 2
  1. 1.Department of Computer ScienceUniversity of ChicagoChicagoUSA
  2. 2.Math. and Computer Science DivisionArgonne National LaboratoryArgonneUSA