Share Email Print
cover

Proceedings Paper

An adaptive data placement scheme for scaleable object storage system
Author(s): Yihui Luo; Wei Deng
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Scaleable storage system has contradiction between usability and extendibility, so a suitable data placement scheme is given to solve this problem in scaleable object storage system. This scheme includes data placement algorithm and data reorganization algorithm. The data placement scheme has the following characteristics: the data placement algorithm uses key as the seed of random data generator to map data objects to storage nodes, which can provide reliable accessing to scaleable storage system. The data placement algorithm distributes data objects uniformly among storage nodes, which can improve I/O performance by accessing simultaneously several nodes. The data reorganization algorithm migrates data only from old storage nodes to added storage nodes (or from withdrawn nodes to surplus nodes), which can improve usability by reducing data migration. At last, the two algorithms have less cost of time and space, which is suitable to large-scale storage systems.

Paper Details

Date Published: 19 March 2009
PDF: 5 pages
Proc. SPIE 7125, Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage, 712527 (19 March 2009); doi: 10.1117/12.823263
Show Author Affiliations
Yihui Luo, Hubei Univ. (China)
Wei Deng, Hubei Univ. (China)


Published in SPIE Proceedings Vol. 7125:
Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage
Fuxi Gan, Editor(s)

© SPIE. Terms of Use
Back to Top