A Graph-Based Approach For Placement Of No-Replicated Databases In Grid

Autor: Cherif Haddad, Faouzi Ben Charrada
Jazyk: angličtina
Rok vydání: 2008
Předmět:
DOI: 10.5281/zenodo.1060943
Popis: On a such wide-area environment as a Grid, data placement is an important aspect of distributed database systems. In this paper, we address the problem of initial placement of database no-replicated fragments in Grid architecture. We propose a graph based approach that considers resource restrictions. The goal is to optimize the use of computing, storage and communication resources. The proposed approach is developed in two phases: in the first phase, we perform fragment grouping using knowledge about fragments dependency and, in the second phase, we determine an efficient placement of the fragment groups on the Grid. We also show, via experimental analysis that our approach gives solutions that are close to being optimal for different databases and Grid configurations.
{"references":["I. D. Baev and R. Rajaraman. Approximation algorithms for data\nplacement in arbitrary networks. In SODA-01: Proceedings of the twelfth\nannual ACM-SIAM Symposium on Discrete Algorithms, pages 661-670,\nPhiladelphia, PA, USA, 2001.","A. Brinkmann, K. Salzwedel, and C. Scheideler. Compact, adaptive\nplacement schemes for non-uniform capacities. In Proceedings of the\n14th ACM Symp. on Parallel Algorithms and Architectures (SPAA),\npages 53-62, Winnipeg, Manitoba, Canada, August 2002.","D. G. Cameron, R. Carvajal-Schiaffino, A. P. Millar, C. Nicholson, K.\nStockinger, and F. Zini. Optorsim: A simulation tool for scheduling and\nreplica optimisation in data grids. In Proceedings of Computing in High\nEnergy Physics, CHEP 2004, Interlaken, Switzerland, 2004.","Y. Huang and J. Chen. Fragment allocation in distributed database\ndesign. Journal of Information Science and Engineering, 17(3):491-506,\n2001.","Y. Huang and N. Venkatasubramanian. Data placement in intermittently\navailable environments. In High Performance Computing - HiPC 2002,\n9th International Conference, volume 2552 of Lecture Notes in\nComputer Science, pages 367-376, Bangalore, India, December 2002.\nSpringer-Verlag.","T. Kosar and M. Livny. Stork: Making data placement a first class\ncitizen in the grid. In Proceedings of 24th IEEE Int. Conference on\nDistributed Computing Systems,(ICDCS2004), Tokyo, March 2004.","K. Ranganathan and I. Foster. Decoupling computation and data\nscheduling in distributed data-intensive applications. In International\nSymposium of High Performance Distributed Computing, HPDC-11,\nEdinburgh, Scotland, July 2002.","H. Stockinger. Distributed database management systems and the data\ngrid. In 18th IEEE Symposium on Mass Storage Systems and 9th NASA\nGoddard Conference on Mass Storage Systems and Technologies, San\nDiego, CA, April 17-20 2001.","H. Stockinger, Omer F. Rana, R. Moore, and A. Merzky. Data\nmanagement for grid environments. In High-Performance Computing\nand Networking, 9th International Conference, HPCN Europe 2001,\nvolume 2110 of Lecture Notes in Computer Science, pages 151-160,\nAmsterdam, The Netherlands, June 2001. Springer-Verlag."]}
Databáze: OpenAIRE
Externí odkaz: