Skip to main content
SpringerLink
Log in

An Adaptive Data Objects Placement Algorithm for Non-uniform Capacities

  • Conference paper
Grid and Cooperative Computing - GCC 2004 (GCC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3251))

Included in the following conference series:

Abstract

The capacities of storage nodes usually are non-uniform and storage nodes are dynamically changed in large-scale distributed storage systems. In this paper, a novel dynamic data objects placement algorithm is proposed; data objects are always distributed among the storage nodes according to their capabilities. When storage nodes are changed, it affords to immediately rebalance data objects distribution according to weight of storage nodes. Simulation results indicates that data objects are always distributed among the storage nodes according to their capabilities and data objects are migrated throughout all storage nodes in parallel, resulting in minimum amount of replacement of objects.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Litwin, W., Neimat, M.A., Schneider, D.A.: LH*-a scalable, distributed data structure. ACM Transactions on Database Systems 21(4), 480–525 (1996)

    Article  Google Scholar 

  2. Devine, R.: Design and Implementation of DDH: Distributed Dynamic Hashing. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, Springer, Heidelberg (1993)

    Google Scholar 

  3. Choy, D.M., Fagin, R., Stockmeyer, L.: Efficiently extendible mappings for balanced data distribution. Algorithmica 16, 215–232 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Brinkmann, A., Salzwedel, K., Scheideler, C.: Efficient, distributed data placement strategies for storage area networks. In: Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 119–128. ACM Press, New York (2000) (extended abstract)

    Google Scholar 

  5. Brinkmann, A., Salzwedel, K., Scheideler, C.: Compact, adaptive placement schemes for non-uniform capacities. In: Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Winnipeg, Manitoba, Canada, August 2002, pp. 53–62 (2002)

    Google Scholar 

  6. Matsumoto, M., Nishimura, T.: Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. on Modeling and Computer Simulation 8(1), 3–30 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Laboratory for Parallel and Distributed Processing, Changsha, 410073

    Zhong Liu & Xing-Ming Zhou

Authors
  1. Zhong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xing-Ming Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology, Huazhong University of Science and Technology, 430074, Wuhan, China

    Hai Jin

  2. Dept. of CS, Georgia State University, 30302, Atlanta, GA, USA

    Yi Pan

  3. National Laboratory for Parallel and Distributed Processing, NUDT, Changsha, 410073, Hunan, China

    Nong Xiao

  4. Cluster and Grid Computing Lab, Huazhong University of Science and Technology, 430074, Wuhan, China

    Jianhua Sun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Z., Zhou, XM. (2004). An Adaptive Data Objects Placement Algorithm for Non-uniform Capacities. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30208-7_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23564-4

  • Online ISBN: 978-3-540-30208-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation