Effective dynamic replica maintenance algorithm for the Grid environment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3947 LNCS, Issue , 2006, Pages 336-345

  Rahman, Rashedur M ^a   Barker, Ken ^a   Alhajj, Reda ^a,b  

^a UNIVERSITY OF CALGARY   (Canada)

^b GLOBAL UNIVERSITY   (Lebanon)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; DATABASE SYSTEMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

ACCESS LATENCY; DYNAMIC MAINTENANCE ALGORITHM; REPLICA PLACEMENT PROBLEM; RESPONSE TIME;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33745866565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745693_34     Document Type: Conference Paper

References (16)

1. Bell W., et al., OptorSim- A Grid Simulator for Studying Dynamic Data Replication Strategies. Journal of High Performance Computing Applications, 17(4), 2003.
2. Buyya R., Abramson D., and Giddy J., Nimrod/G: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid, Proc. of HPC Asia, pp.283-289, Beijing, China, 2000.
3. Chervenak A., et al., The Data Grid: To wards and Architecture for the Distributed Management and Analysis of Large Scientific Data Sets. Journal of Network and Computer Applications, 23(3), pp. 187-200, 2000.
4. Daskin M.S., Network and Discrete Location Models: Algorithms and Applications, John Wiley & Sons, 1995.
5. Drezner Z., and Hamacher H. W., Facility Location Applications and Theory, Springer Verlag, Berlin, Germany, 2002.
6. Fisher M.L., The Lagrangian relaxation method for solving integer programming problems, Management Science, 27, 1-18.
7. Foster I., Internet Computing and the Emerging Grid, Nature Web Matters, 2000.
8. Foster, I., Kesselman C., Tuecke S., The Anatomy of the Grid: Enabling Scalable Virtual Organizations. J. Supercomputer Applications, 5(3), 2001.
9. Foster I. and Kesselman C., The Grid: Blueprint for a New Computing Infrastructure.
10. Hakami S., Optimum location of switching centers and the absolute centers and medians of a graph, Operations Research, 12, 450-459.
11. Kavitha R., Iamnitchi A. and Foster I., Improving Data Availability through Dynamic Model Driven Replication in Large Peer-to-Peer Communities. Proc. of Global and Peer-to-Peer Computing on Large Scale Distributed Systems Workshop, Berlin, 2002.
12. Kavitha R., and Foster I., Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications. Proceedings of IEEE International Symposium on High Performance Distributed Computing Edinburgh, Scotland, July 2002
13. Kavitha R., and Foster I., Design and Evaluation of Replication Strategies for a High Performance Data Grid, in Computing and High Energy and Nuclear Physics 2001.
14. Rahman R. M., Barker K. and Alhajj R., Replica Placement on Data Grid: Considering Utility and Risk. Proc. of IEEE Intrn'l Conf. on Coding and Computing, 2005.
15. Toregas C., et al., The location of emergency service facilities, Operations Research, 19, 1363-1373.
16. Wesolowsky G.O. and Truscott W.G., The multiperiod location-allocation problem with relocation of facilities. Management Science, 22, Sept., 1975.