EOP: An Efficient Object Placement and Location Algorithm for OBS Cluster

  • Changsheng Xie
  • Xu Li
  • Qinqi Wei
  • Qiang Cao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4494)


A new generation storage system which called Object-Based Storage system (OBS) is emerging as the foundation for building massively parallel storage system. In the OBS, data files are usually stripped into multiple objects across OBS’s nodes to improve the system I/O throughput. A fundamental problem that confronts OBS is to efficiently place and locate objects in the dynamically changing environment. In this paper, we develop EOP: an efficient algorithm based on dynamic interval mapping method for object placement and lookup services. The algorithm provides immediately rebalance data objects distribution with the nodes’ addition, deletion and capability weight changing. Results from theoretical analysis, simulation experiments demonstrate the effectiveness of our EOP algorithm.


OBS object placement interval mapping hash function 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Mesnier, M., Ganger, G.R., et al.: Object-based Storage. IEEE Communications Magazine 41(8), 84–91 (2003)CrossRefGoogle Scholar
  2. 2.
    Feng, D., Qin, L.: Adaptive Object Placement in Object-Based Storage Systems with Minimal Blocking Probability. In: Proceedings of the 20th International Conference on Advanced Information Networking and Applications, AINA 2006 (2006)Google Scholar
  3. 3.
    Litwin, W., Neimat, M.A., Schneider, D.A.: LH*—A scalable, distributed data structure. ACM Trans. on Database Systems, pp. 480–525 (1996)Google Scholar
  4. 4.
    Choy, D. M., Fagin, R., Stockmeyer, L.: Efficiently extendible mappings for balanced data distribution. Algorithmica, pp. 215–232 (1996)Google Scholar
  5. 5.
    Kubiatowicz, D.B., et al.: OceanStore: An architecture for global-scale persistent storage. In: Proc. of the International Conference on Architectural Support for Programming Languages and Operating Systems, ACM Press, New York (2000)Google Scholar
  6. 6.
    Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report, UCB/CSD- 01-1141, Berkeley Computer Science Division, University of California (2001)Google Scholar
  7. 7.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)Google Scholar
  8. 8.
    Honicky, R.J., Miller, E.: Replication Under Scalable Hashing: A Family of Algorithms for Scalable. In: Proceedings of the 18th International Parallel & Distributed Processing Symposium (2004)Google Scholar
  9. 9.
    Kanagavelu, R., Leong, Y. K.: A Bit-Window based Algorithm for Balanced and Efficient Object Placement and Lookup in Large-scale Object Based Storage Cluster. In: IEEE Conference on Mass Storage Systems and Technologies, MSST2006 (2006)Google Scholar
  10. 10.
    Zhong, L., Xing-Ming, Z.: A Data Object Placement Algorithm Based on Dynamic Interval Mapping. Journal of Software, 1886–1893 (2005)Google Scholar
  11. 11.
    Braam, P.J.: The Lustre Storage Architecture.: Cluster File Systems, Inc. (2003)
  12. 12.
    Nagle, D., Serenyi, D., Matthews, A.: The Panasas Active Scale Storage Cluster-Delivering Scalable High Bandwidth Storage. IEEE SC2004 (2004)Google Scholar
  13. 13.
    Anderson, R., Biham, E.: Tiger: A Fast New Hash Function. In: Gollmann, D. (ed.) Fast Software Encryption 3. LNCS, vol. 1039, Springer, Heidelberg (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Changsheng Xie
    • 1
  • Xu Li
    • 1
  • Qinqi Wei
    • 1
  • Qiang Cao
    • 1
  1. 1.Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, Hubei, 430074China

Personalised recommendations