The complexity of static data replication in data grids

Parallel Computing

Volumn 31, Issue 8-9, 2005, Pages 900-912

  Čibej, Uroš ^a   Slivnik, Boštjan ^a   Robič, Borut ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Data replication; Grid computing; Non approximable problem; NP hard problem; Optimization problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; FAULT TOLERANT COMPUTER SYSTEMS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

DATA REPLICATION; GRID COMPUTING; NON-APPROXIMABLE PROBLEMS; OPTIMIZATION PROBLEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 25644455950     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2005.04.010     Document Type: Article

References (17)

1. Y. Bartal, M. Charikar, and P. Indyk On page migration and other relaxed task systems Theoretical Computer Science 1 268 2001 43 66 Available from: 〈citeseer.ist.psu.edu/article/bartal97page.html〉.
2. W.H. Bell, D.G. Cameron, L. Capozza, A.P. Millar, K. Stockinger, and F. Zini Simulation of Dynamic Grid Replication Strategies in OptorSim Proceedings of the 3rd international IEEE workshop on grid computing (Grid'2002), November 2002, Baltimore, USA Lecture Notes in Computer Science 2002 Springer-Verlag Berlin
3. W.H. Bell, D.G. Cameron, R. Carvajal-Schiaffino, A.P. Millar, K. Stockinger, and F. Zini Evaluation of an economy-based file replication strategy for a data grid International Workshop on Agent Based Cluster and Grid Computing at CCGrid 2003 May 2003 IEEE Computer Society Press Silver Spring, MD
4. M. Carman, F. Zini, L. Serafini, and K. Stockinger Towards an economy-based optimisation of file access and replication on a data grid International Workshop on Agent Based Cluster and Grid Computing at International Symposium on Cluster Computing and the Grid (CCGrid'2002) May 2002 2002 IEEE Computer Society Press Silver Spring, MD
5. M.S. Daskin Models Algorithms and Applications 1995 John Wiley and Sons Inc., Network and Discrete Location New York
6. L.W. Dowdy, and D.V. Foster Comparative models of the file assignment problem ACM Computing Surveys (CSUR 2 14 1982 287 313 (0360-0300)
7. R. Fleischer, S. Seiden, Page replication-variations on a theme (1999) Available from: 〈citeseer.nj.nec.com/fleischer99page.html〉.
8. I. Foster, and C. Kesselman The Grid Blueprint for a New Computing Infrastructure 1999 Morgan Kaufmann Publishers Los Altos, CA
9. I. Foster, C. Kesselmann, and S. Tuecke The anatomy of the grid: enabling scalable virtual organizations IJSA 2001
10. R.M. Garey, and D.S. Johnson Computers and Intractability vol. 19 1997 W.H. Freeman and Company New York
11. E. Grapa, and G.G. Belford Some theorems to aid in solving the file allocation problem Communications of the ACM 11 20 1977 878 882 (0001-0782)
12. L. Guy, P. Kunszt, E.Laure, H. Stockinger, K. Stockinger, Replica management in Data Grids in: GGF5, Edinburgh June 2002.
13. Available from: 〈www.gridcomputing.com〉 Grid computing info center.
14. Available from: 〈http://www.eu-datagrid.org/〉 The European DataGrid project homepage.
15. L. Qiu, V.N. Padmanabhan, and G.M. Voelker On the placement of Web server replicas INFOCOM 2001 1587 1596 Available from: 〈citeseer.ist.psu.edu/ qiu01placement.html〉
16. H. Stockinger, Database replication in world-wide distributed data grids, Fakultät für Wirtschaftswissenschaften und Informatik Universität Wien, 2001 November.
17. L.A. Wolsey Integer Programming 1998 Wiley-Interscience New York