Advertisement

Effective Load-Balancing via Migration and Replication in Spatial Grids

  • Anirban Mondal
  • Kazuo Goda
  • Masaru Kitsuregawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2736)

Abstract

The unprecedented growth of available spatial data at geographically distributed locations coupled with the emergence of grid computing provides a strong motivation for designing a spatial grid which supports fast data retrieval and allows its users to transparently access data of any location from anywhere. This calls for efficient search and load-balancing mechanisms. This paper focusses on dynamic load-balancing in spatial grids via data migration/replication to prevent degradation in system performance owing to severe load imbalance among the nodes. The main contributions of our proposal are as follows. First, we view a spatial grid as comprising several clusters where each cluster is a local area network (LAN) and propose a novel inter-cluster load-balancing algorithm which uses migration/replication of data. Second, we present a novel scalable technique for dynamic data placement that not only improves data availability but also minimizes disruptions and downtime to the system. Our performance study demonstrates the effectiveness of our proposed approach in correcting workload skews, thereby facilitating improvement in system performance. To our knowledge, this work is one of the earliest attempts at addressing load-balancing via both online data migration and replication in grid environments.

Keywords

Destination Node Data Movement Disk Space Grid Environment Spatial Grid 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boral, H., Alexander, W., Clay, L., Copeland, G., Danforth, S., Franklin, M., Hart, B., Smith, M., Valduriez, P.: Prototyping Bubba, a highly parallel database system. In: Proc. IEEE TKDE, vol. 2(1) (March 1990)Google Scholar
  2. 2.
  3. 3.
  4. 4.
    Epema, D.H.J., Livny, M., Dantzig, R.V., Evers, X., Pruyne, J.: A worldwide flock of Condors: Load sharing among workstation clusters. Journal on Future Generations of Computer Systems 12 (1996)Google Scholar
  5. 5.
    Foster, I., Kesselman, C.: The grid: Blueprint for a new computing infraestructure. Morgan-Kaufmann, San Francisco (1999)Google Scholar
  6. 6.
    Earth Systems Grid, http://www.earthsystemgrid.org/
  7. 7.
    Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD, pp. 47–57 (1984)Google Scholar
  8. 8.
  9. 9.
    Mondal, A., Kitsuregawa, M., Ooi, B.C., Tan, K.L.: R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases. In: Proc. ACM GIS (2001)Google Scholar
  10. 10.
    Patel, J., DeWitt, D.: Partition based spatial-merge join. In: Proc. ACM SIGMOD, pp. 259–270 (1996)Google Scholar
  11. 11.
  12. 12.
    Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the UB-tree into a database system kernel. In: Proc. VLDB, pp. 263–272 (2000)Google Scholar
  13. 13.
    Thain, D., Basney, J., Son, S.C., Livny, M.: The Kangaroo approach to data movement on the grid. In: Proc. HPDC (2001)Google Scholar
  14. 14.
    Thain, D., Bent, J., Arpaci-Dusseau, A., Arpaci-Dusseau, R., Livny, M.: Gathering at the well: Creating communities for grid I/O. In: Proc. SC (2001)Google Scholar
  15. 15.
    Weikum, G., Zabback, P., Scheuermann, P.: Dynamic file allocation in disk arrays. In: Proc. ACM SIGMOD, pp. 406–415 (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Anirban Mondal
    • 1
  • Kazuo Goda
    • 1
  • Masaru Kitsuregawa
    • 1
  1. 1.Institute of Industrial ScienceUniversity of TokyoJapan

Personalised recommendations