Abstract
In the Data Grid environment, the primary goal of data replication is to shorten the data access time that is experienced by the job and reduce the job turnaround time as a consequence. After introducing a Data Grid architecture that supports efficient data access for the Grid job, two dynamic data replication algorithms are put forward. Combined with different Grid scheduling heuristics, the performances of the data replication algorithms are evaluated with various simulations. The simulation results demonstrate that the dynamic replication algorithms can reduce the job turnaround time remarkably. Especially the combination of Shortest Turnaround Time (STT) scheduling heuristic and Centralized Dynamic Replication (CDR) algorithm exhibits prominent performance in diverse conditions of workload and system environment.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ranganathan, K., Foster, I.: Simulation studies of computation and data scheduling algorithms for data grids. Journal of Grid Computing 1, 53–62 (2003)
Takefusa, A., Tatebe, O., Matsuoka, S., Morita, Y.: Performance analysis of scheduling and replication algorithms on grid datafarm architecture for high-energy physics applications. In: Proceedings of 12th IEEE International Symposium on High Performance Distributed Computing, HPDC 2003 (2003)
Cameron, D.G., Millar, A.P., Nicholson, C., Carvajal-Schiaffino, R., Zini, F., Stockinger, K.: Analysis of scheduling and replica optimisation strategies for data grids using optorsim. Journal of Grid Computing (to appear)
Feitelson, D.G., Rudolph, L.: Metrics and benchmarking for parallel job scheduling. In: Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, pp. 1–24 (1998)
Cirne, W., Berman, F.: When the herd is smart: aggregate behavior in the selection of job request. IEEE Transactions on Parallel and Distributed Systems 14, 181–192 (2003)
Zipf, G.K.: Human Behavior and the Principles of Least Effort. Addison-Wesley, Reading (1949)
Lee, C.B., Schwartzman, Y., Hardy, J., Snavely, A.: Are user runtime estimates inherently inaccurate? In: Proceedings of 10th Job Scheduling Strategies for Parallel Processing (2004)
Chapin, S.J., Cirne, W., Feitelson, D.G., Jones, J.P., Leutenegger, S.T., Schwiegelshohn, U., Smith, W., Talby, D.: Benchmarks and standards for the evaluation of parallel job schedulers. In: Proceedings of 5th Job Scheduling Strategies for Parallel Processing (1999)
Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing 59, 107–131 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, M., Lee, BS., Tang, X., Yeo, CK. (2005). Combining Data Replication Algorithms and Job Scheduling Heuristics in the Data Grid. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_45
Download citation
DOI: https://doi.org/10.1007/11549468_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)