Abstract
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.
This research is supported by National 973 Great Research Project of P.R. China under grant No. 2004CB318203 and National Natural Science Foundation under grant No. 60603074 and No. 60603075.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mesnier, M., Ganger, G.R., et al.: Object-based Storage. IEEE Communications Magazine 41(8), 84–91 (2003)
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)
Litwin, W., Neimat, M.A., Schneider, D.A.: LH*—A scalable, distributed data structure. ACM Trans. on Database Systems, pp. 480–525 (1996)
Choy, D. M., Fagin, R., Stockmeyer, L.: Efficiently extendible mappings for balanced data distribution. Algorithmica, pp. 215–232 (1996)
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)
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)
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)
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)
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)
Zhong, L., Xing-Ming, Z.: A Data Object Placement Algorithm Based on Dynamic Interval Mapping. Journal of Software, 1886–1893 (2005)
Braam, P.J.: The Lustre Storage Architecture.: Cluster File Systems, Inc. (2003) http://www.lustre.org/docs/lustre.pdf
Nagle, D., Serenyi, D., Matthews, A.: The Panasas Active Scale Storage Cluster-Delivering Scalable High Bandwidth Storage. IEEE SC2004 (2004)
Anderson, R., Biham, E.: Tiger: A Fast New Hash Function. In: Gollmann, D. (ed.) Fast Software Encryption 3. LNCS, vol. 1039, Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, C., Li, X., Wei, Q., Cao, Q. (2007). EOP: An Efficient Object Placement and Location Algorithm for OBS Cluster. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)