Abstract
Grid computing is a type of parallel and distributed systems, that is designed to provide pervasive and reliable access to data and computational resources over wide are network. Data Grids connect a collect of geographically distributed computers and storage resources located in different parts of the world to facilitate sharing of data and resources. These grids are concentrated on the reduction of the execution time of the applications that require a great number of processing cycles by the computer. In such environment, these advantages are not possible unless by the use of the replication. This later is considered as an important technique to reduce the cost of access to the data in grid. In this present paper, we present our contribution to a cost model whose objective is to reduce the cost of access to replicated data. These costs depend on many factors like the bandwidth, data size, network latency and the number of the read/ write operations.
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
Deris, M.M., Abawajy, J.H., Suzuri, H.M.: An Efficient Replicated Data Access Approach for Large-Scale Distributed Systems, IEEE International Symposium CCGrid 2004, Chicago, Illinois, USA (April 19-22, 2004)
Goel, S., Sharda, H., Taniar, D.: Replica Synchronization in Grid Databases. Int. Journal Web and Grid Services 1(1), 87–112 (2005)
The European Organization for Nuclear Physics CERN DataGrid Project, http://grid.web.cern.ch/grid/
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. Int. Journal Supercomputer Applications 15(3) (2003)
Lamehamedi, H., Szymanski, B., Deelman, E.: Data Replication Strategies in Grid Environments. In: Proc. 5th International Conference on Algorithms and Architecture for Parallel Processing, ICA3PP 2002, Bejing, China, pp. 378–383 (2002)
Leiserson, C.H.: Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Trans. on Comp. C-34(10), 892–901 (1985)
NS Network Simulator, http://www.mash.cs.berkeley.edu/ns
Parhamu, B.: Introduction to Parallel Processing: Algorithms and Architectures, Plenum (1999)
Raynal, M.: Gestion des Donnees Reparties: Problemes et Protocoles. Tome3: Introduction aux principes des systemes repartis, Eyrolles, France (1992)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)
Xu, J., Li, B., Lun Lee, D.: Placement Problems for Transparent Data Replication Proxy Services. IEEE Journal on Selected Areas in Communications 20(7) (September 2002)
Milojicic, D.: Peer to Peer Technology, HP Labs Technical Report, HPL-2002-57, http://www.hpl.hp.com/techreports/2002/HPL-2002-57.html
Guyton, J.D., Michael, F.S.: Locating Nearby Copies of Replicated Internet Servers, University of Colorado, TR CU-CS-762-95
Ranganathan, K., Foster, I.: Identifying Dynamic Replication Strategies for a High Performance Data Grid. In: Proc. of the International Grid Computing Workshop, Denver, CO (November 2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belalem, G., Bouhraoua, F. (2007). Dynamic Strategy of Placement of the Replicas in Data Grid. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2007. Lecture Notes in Computer Science, vol 4671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73940-1_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-73940-1_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73939-5
Online ISBN: 978-3-540-73940-1
eBook Packages: Computer ScienceComputer Science (R0)