Abstract
Data grid replication is critical for improving the performance of data intensive applications. Most of the used techniques for data replication use Replica Location Services (RLS) to resolve the logical name of files to its physical locations. An example of such service is Giggle, which can be found in the OGSA/Globus architecture. Classical algorithms also need some catalog and optimization services. For example, the EGEE DataGrid project, based in Globus open source components, implements for this purpose the Replica Optimization Service (ROS) and the Replica Metadata Catalog (RMC). In this paper we propose a new approach for improving the performance of Data grid replication. With this aim, we apply Emergent Artificial Intelligence (EAI) techniques to data replication. The paper describes a new algorithm for replica selection in grid environments based on a PSO-LRU (Particle Swarm Optimization) approach. For evaluating this technique we have implemented a grid simulator called SiCoGrid. The simulation results presented in the paper demonstrate that the new technique improve the performance compared with traditional solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C.: Globus: A metacomputing infrastructure toolkit. IJSA 11(2), 115–128 (1997)
Foster, I., Kesselman, C.: M.Nick, J., Tuecke, S.: The physiology of the grid an open grid services architecture for distributed system integration. Technical report, Globus Proyect Draft Overwiev Paper (2002)
Chervenak, A.L., et al.: Giggle: A framework for constructing scalable replica location services. In: Proc. of the IEEE Supercomputing Conference (SC 2002), November 2002, IEEE Computer Society Press, Los Alamitos (2002)
Lamehamedi, H., Szymanski, B.: shentu, Z., Deelman, E.: Data replication strategies in grid environments. In: Proceedings Of the Fifth International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP02 (2002)
Leiserson, C.H.: Flat-trees: Universal network for hardware-efficient supercomputing. IEEE Transactions on Computers 34(10), 892–901 (1985)
Ns network simulator (1989), http://www.mash.cs.berkeley.edu/ns
Bell, W.H., et al.: Simulation of dynamic grid replication strategies in optorsim. In: Parashar, M. (ed.) GRID 2002. LNCS, vol. 2536, Springer, Heidelberg (2002)
Cameron, D.G., et al.: Evaluating scheduling and replica optimisation strategies in optorsim. In: International Workshop on Grid Computing (Grid 2003), November 2003, IEEE Computer Society Press, Los Alamitos (2003)
Capozza, L., Stockinger, K., Zini, F.: Preliminary evaluation of revenue prediction functions for economically-effective file replication. Technical report, DataGrid-02-TED-020724, Geneva, Switzerland (July 2002)
Bell, W.H., et al.: Optorsim - a grid simulator for studying dynamic data replication strategies. International Journal of High Performance Computing Applications 17(4) (2003)
Cameron, D.G., et al.: Analysis of scheduling and replica optimisation strategies for data grids using optorsim. International Journal of Grid Computing 2(1), 57–69 (2004)
Cameron, D.G., et al.: Optorsim: A simulation tool for scheduling and replica optimisation in data grids. In: International Conference for Computing in High Energy and Nuclear Physics (CHEP 2004), Interlaken (September 2004)
Cai, M. Chervenak, A., M.F.: A peer-to-peer replica location service based on a distributed hash table. In: Proceedings of the High Performance Computing, Networking and Storage Conference, SCGlobal (2004)
Ripeanu, M., Foster, I.: A decentralized, adaptive replica location mechanism. In: 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11), IEEE Computer Society Press, Los Alamitos (2002)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 69–73. IEEE Computer Society Press, Piscataway (1998)
Cockshott, Hartman: Improving the fermentation medium for echinocandin b production part ii: Particle swarm optimization. Process Biochemistry 36, 661–669 (2001)
Yoshida,, Kawata,, Fukuyama,: A particle swarm optimization for reactive power and voltage control considering voltage security assessment. IEEE Trans. on Power Systems 15, 1232–1239 (2001)
Cheshire, S.: It’s the latency, stupid. Technical report, Stanford University (1996)
Leijen, D.: Parsec, a fast combinator parser. Technical report, Computer Science Department, University of Utrecht (2002)
Granger, R., et al.: The DiskSim Simulation Environment. Version 2.0 Reference Manual. University of Michigan (1999)
Deng, S.: Empirical model of www document arrivals at access link. In: Proceedings of the 1996 IEEE International Conference on Communication, IEEE Computer Society Press, Los Alamitos (1996)
Barford, P., Crovella, M.: Generating representative web workloads. In: Network and Server Performance Evaluation In Proceedings of the 1998 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS, pp. 151–160. ACM Press, New York (1998)
Ranganathan, K., Foster, I.: Identifying dynamic replication strategies for a high-performance data grid. Technical report, Departament of Computer Science, The University of Chicago (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Muñoz, V.M., Carballeira, F.G. (2007). PSO-Grid Data Replication Service. In: Daydé, M., Palma, J.M.L.M., Coutinho, Á.L.G.A., Pacitti, E., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2006. VECPAR 2006. Lecture Notes in Computer Science, vol 4395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71351-7_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-71351-7_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71350-0
Online ISBN: 978-3-540-71351-7
eBook Packages: Computer ScienceComputer Science (R0)